/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_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:55:03,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:55:03,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:55:03,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:55:03,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:55:03,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:55:03,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:55:03,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:55:03,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:55:03,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:55:03,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:55:03,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:55:03,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:55:03,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:55:03,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:55:03,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:55:03,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:55:03,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:55:03,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:55:03,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:55:03,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:55:03,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:55:03,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:55:03,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:55:04,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:55:04,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:55:04,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:55:04,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:55:04,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:55:04,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:55:04,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:55:04,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:55:04,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:55:04,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:55:04,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:55:04,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:55:04,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:55:04,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:55:04,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:55:04,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:55:04,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:55:04,023 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:55:04,039 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:55:04,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:55:04,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:55:04,043 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:55:04,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:55:04,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:55:04,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:55:04,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:55:04,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:55:04,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:55:04,046 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:55:04,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:55:04,046 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:55:04,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:55:04,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:55:04,047 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:55:04,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:55:04,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:55:04,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:55:04,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:55:04,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:55:04,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:55:04,049 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:55:04,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:55:04,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:55:04,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:55:04,562 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:55:04,563 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:55:04,564 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-09-04 21:55:04,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f30190731/a455a617b3a846788b54b24d9ec21c5b/FLAG1c1795d0a [2020-09-04 21:55:05,241 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:55:05,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-09-04 21:55:05,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f30190731/a455a617b3a846788b54b24d9ec21c5b/FLAG1c1795d0a [2020-09-04 21:55:05,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f30190731/a455a617b3a846788b54b24d9ec21c5b [2020-09-04 21:55:05,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:55:05,549 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:55:05,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:05,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:55:05,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:55:05,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:05" (1/1) ... [2020-09-04 21:55:05,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bcc6958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05, skipping insertion in model container [2020-09-04 21:55:05,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:55:05" (1/1) ... [2020-09-04 21:55:05,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:55:05,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:55:05,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:05,864 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:55:05,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:55:05,905 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:55:05,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05 WrapperNode [2020-09-04 21:55:05,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:55:05,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:55:05,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:55:05,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:55:05,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05" (1/1) ... [2020-09-04 21:55:05,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05" (1/1) ... [2020-09-04 21:55:06,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05" (1/1) ... [2020-09-04 21:55:06,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05" (1/1) ... [2020-09-04 21:55:06,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05" (1/1) ... [2020-09-04 21:55:06,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05" (1/1) ... [2020-09-04 21:55:06,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05" (1/1) ... [2020-09-04 21:55:06,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:55:06,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:55:06,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:55:06,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:55:06,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:55:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:55:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:55:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-04 21:55:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:55:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:55:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:55:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-04 21:55:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:55:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:55:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:55:06,351 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:55:06,352 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:55:06,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:06 BoogieIcfgContainer [2020-09-04 21:55:06,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:55:06,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:55:06,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:55:06,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:55:06,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:55:05" (1/3) ... [2020-09-04 21:55:06,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0a72f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:06, skipping insertion in model container [2020-09-04 21:55:06,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:55:05" (2/3) ... [2020-09-04 21:55:06,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0a72f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:55:06, skipping insertion in model container [2020-09-04 21:55:06,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:55:06" (3/3) ... [2020-09-04 21:55:06,375 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-09-04 21:55:06,391 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:55:06,419 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:55:06,456 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:55:06,498 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:55:06,498 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:55:06,498 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:55:06,498 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:55:06,499 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:55:06,499 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:55:06,499 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:55:06,499 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:55:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-09-04 21:55:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:55:06,533 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:06,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:06,535 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:06,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-09-04 21:55:06,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:06,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [304475801] [2020-09-04 21:55:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:06,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:06,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:55:06,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [304475801] [2020-09-04 21:55:06,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:06,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:06,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770211586] [2020-09-04 21:55:06,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:06,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:06,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:06,890 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-09-04 21:55:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:07,026 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-09-04 21:55:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:55:07,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:55:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:07,042 INFO L225 Difference]: With dead ends: 44 [2020-09-04 21:55:07,043 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 21:55:07,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 21:55:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 21:55:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:55:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 21:55:07,109 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-09-04 21:55:07,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:07,110 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 21:55:07,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 21:55:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 21:55:07,113 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:07,113 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:55:07,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:55:07,114 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-09-04 21:55:07,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:07,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [53620666] [2020-09-04 21:55:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:55:07,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [53620666] [2020-09-04 21:55:07,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:55:07,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:55:07,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319460534] [2020-09-04 21:55:07,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:55:07,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:55:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:55:07,189 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-09-04 21:55:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:07,268 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-09-04 21:55:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:55:07,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 21:55:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:07,271 INFO L225 Difference]: With dead ends: 36 [2020-09-04 21:55:07,272 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:55:07,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:55:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-09-04 21:55:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:55:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 21:55:07,286 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-09-04 21:55:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:07,286 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 21:55:07,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:55:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 21:55:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 21:55:07,288 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:07,289 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:55:07,289 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:55:07,289 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-09-04 21:55:07,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:07,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1750966435] [2020-09-04 21:55:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:55:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,457 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:55:07,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1750966435] [2020-09-04 21:55:07,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:07,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:55:07,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794606177] [2020-09-04 21:55:07,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:55:07,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:07,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:55:07,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:55:07,461 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-09-04 21:55:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:07,596 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-09-04 21:55:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:55:07,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 21:55:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:07,599 INFO L225 Difference]: With dead ends: 52 [2020-09-04 21:55:07,599 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:55:07,600 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:55:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:55:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 21:55:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:55:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 21:55:07,619 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-09-04 21:55:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:07,620 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 21:55:07,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:55:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 21:55:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:55:07,624 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:07,624 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:55:07,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:55:07,625 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:07,626 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-09-04 21:55:07,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:07,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2117983666] [2020-09-04 21:55:07,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,765 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:55:07,766 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2117983666] [2020-09-04 21:55:07,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:07,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:55:07,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210382759] [2020-09-04 21:55:07,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:55:07,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:07,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:55:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:55:07,769 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-09-04 21:55:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:07,906 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-09-04 21:55:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:55:07,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-09-04 21:55:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:07,910 INFO L225 Difference]: With dead ends: 56 [2020-09-04 21:55:07,910 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 21:55:07,911 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:55:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 21:55:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 21:55:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 21:55:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-09-04 21:55:07,928 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-09-04 21:55:07,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:07,929 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-09-04 21:55:07,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:55:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-09-04 21:55:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:55:07,932 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:07,932 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:55:07,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:55:07,933 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-09-04 21:55:07,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:07,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1789893191] [2020-09-04 21:55:07,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:07,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,107 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:55:08,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1789893191] [2020-09-04 21:55:08,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:08,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:55:08,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810718028] [2020-09-04 21:55:08,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:55:08,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:55:08,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:55:08,110 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-09-04 21:55:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:08,264 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-09-04 21:55:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:55:08,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 21:55:08,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:08,268 INFO L225 Difference]: With dead ends: 111 [2020-09-04 21:55:08,268 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 21:55:08,269 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:55:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 21:55:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-09-04 21:55:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 21:55:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-09-04 21:55:08,286 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-09-04 21:55:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:08,286 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-09-04 21:55:08,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:55:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-09-04 21:55:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:55:08,289 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:08,290 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:55:08,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:55:08,290 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:08,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:08,291 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-09-04 21:55:08,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:08,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [463805031] [2020-09-04 21:55:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,455 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:55:08,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [463805031] [2020-09-04 21:55:08,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:08,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:55:08,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394693312] [2020-09-04 21:55:08,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:55:08,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:55:08,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:55:08,458 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-09-04 21:55:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:08,592 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-09-04 21:55:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:55:08,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-09-04 21:55:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:08,596 INFO L225 Difference]: With dead ends: 89 [2020-09-04 21:55:08,596 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 21:55:08,597 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:55:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 21:55:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-09-04 21:55:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 21:55:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-09-04 21:55:08,616 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-09-04 21:55:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:08,617 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-09-04 21:55:08,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:55:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-09-04 21:55:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:55:08,621 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:08,621 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:55:08,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:55:08,621 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:08,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:08,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-09-04 21:55:08,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:08,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [500735687] [2020-09-04 21:55:08,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:55:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:08,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:55:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,060 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:55:09,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [500735687] [2020-09-04 21:55:09,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:09,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:55:09,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304796614] [2020-09-04 21:55:09,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:55:09,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:09,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:55:09,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:55:09,063 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-09-04 21:55:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:09,441 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-09-04 21:55:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:55:09,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-09-04 21:55:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:09,445 INFO L225 Difference]: With dead ends: 142 [2020-09-04 21:55:09,445 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 21:55:09,447 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:55:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 21:55:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-09-04 21:55:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:55:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-09-04 21:55:09,463 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-09-04 21:55:09,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:09,464 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-09-04 21:55:09,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:55:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-09-04 21:55:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-04 21:55:09,466 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:09,467 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:55:09,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:55:09,467 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:09,468 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-09-04 21:55:09,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:09,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [115620857] [2020-09-04 21:55:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:55:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:55:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:09,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:55:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:55:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,138 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:55:10,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [115620857] [2020-09-04 21:55:10,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:10,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:55:10,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601223314] [2020-09-04 21:55:10,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:55:10,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:10,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:55:10,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:55:10,142 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-09-04 21:55:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:10,660 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-09-04 21:55:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 21:55:10,661 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-09-04 21:55:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:10,664 INFO L225 Difference]: With dead ends: 149 [2020-09-04 21:55:10,664 INFO L226 Difference]: Without dead ends: 92 [2020-09-04 21:55:10,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:55:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-09-04 21:55:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-09-04 21:55:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 21:55:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2020-09-04 21:55:10,697 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 193 [2020-09-04 21:55:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:10,698 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2020-09-04 21:55:10,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:55:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2020-09-04 21:55:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-09-04 21:55:10,701 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:10,701 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:10,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:55:10,702 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:10,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:10,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2080077336, now seen corresponding path program 6 times [2020-09-04 21:55:10,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:10,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [119323614] [2020-09-04 21:55:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:55:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:55:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:10,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:55:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:55:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:55:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:55:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:55:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2955 backedges. 552 proven. 920 refuted. 0 times theorem prover too weak. 1483 trivial. 0 not checked. [2020-09-04 21:55:11,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [119323614] [2020-09-04 21:55:11,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:11,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:55:11,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721434782] [2020-09-04 21:55:11,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:55:11,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:11,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:55:11,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:55:11,567 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 15 states. [2020-09-04 21:55:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:12,212 INFO L93 Difference]: Finished difference Result 194 states and 284 transitions. [2020-09-04 21:55:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 21:55:12,212 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 281 [2020-09-04 21:55:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:12,215 INFO L225 Difference]: With dead ends: 194 [2020-09-04 21:55:12,215 INFO L226 Difference]: Without dead ends: 119 [2020-09-04 21:55:12,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 21:55:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-09-04 21:55:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2020-09-04 21:55:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-09-04 21:55:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 138 transitions. [2020-09-04 21:55:12,234 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 138 transitions. Word has length 281 [2020-09-04 21:55:12,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:12,235 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 138 transitions. [2020-09-04 21:55:12,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:55:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2020-09-04 21:55:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-09-04 21:55:12,241 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:12,242 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:12,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:55:12,242 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash 260846875, now seen corresponding path program 7 times [2020-09-04 21:55:12,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:12,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1616682341] [2020-09-04 21:55:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:55:12,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:55:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:55:12,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:55:12,448 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:55:12,448 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:55:12,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:55:12,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:55:12 BoogieIcfgContainer [2020-09-04 21:55:12,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:55:12,557 INFO L168 Benchmark]: Toolchain (without parser) took 7005.89 ms. Allocated memory was 138.9 MB in the beginning and 323.5 MB in the end (delta: 184.5 MB). Free memory was 101.9 MB in the beginning and 175.0 MB in the end (delta: -73.1 MB). Peak memory consumption was 111.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:12,558 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 138.9 MB. Free memory was 120.3 MB in the beginning and 119.9 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-09-04 21:55:12,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.86 ms. Allocated memory is still 138.9 MB. Free memory was 101.4 MB in the beginning and 92.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:12,560 INFO L168 Benchmark]: Boogie Preprocessor took 133.89 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 181.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:12,565 INFO L168 Benchmark]: RCFGBuilder took 318.58 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 168.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:12,565 INFO L168 Benchmark]: TraceAbstraction took 6190.09 ms. Allocated memory was 202.9 MB in the beginning and 323.5 MB in the end (delta: 120.6 MB). Free memory was 167.9 MB in the beginning and 175.0 MB in the end (delta: -7.1 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:12,576 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.27 ms. Allocated memory is still 138.9 MB. Free memory was 120.3 MB in the beginning and 119.9 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 356.86 ms. Allocated memory is still 138.9 MB. Free memory was 101.4 MB in the beginning and 92.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.89 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 181.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.58 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 168.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6190.09 ms. Allocated memory was 202.9 MB in the beginning and 323.5 MB in the end (delta: 120.6 MB). Free memory was 167.9 MB in the beginning and 175.0 MB in the end (delta: -7.1 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); VAL [fibo(x)=13, result=13, x=7] [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.9s, OverallIterations: 10, TraceHistogramMax: 41, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 553 SDslu, 804 SDs, 0 SdLazy, 864 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 40 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1169 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 791 ConstructedInterpolants, 0 QuantifiedInterpolants, 245967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 3333/4887 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...