/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_2calls_6-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:53:49,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:53:49,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:53:49,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:53:49,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:53:49,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:53:49,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:53:49,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:53:49,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:53:49,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:53:49,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:53:49,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:53:49,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:53:49,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:53:49,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:53:49,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:53:49,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:53:49,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:53:49,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:53:49,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:53:49,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:53:49,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:53:49,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:53:49,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:53:50,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:53:50,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:53:50,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:53:50,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:53:50,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:53:50,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:53:50,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:53:50,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:53:50,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:53:50,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:53:50,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:53:50,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:53:50,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:53:50,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:53:50,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:53:50,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:53:50,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:53:50,024 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:53:50,064 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:53:50,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:53:50,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:53:50,068 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:53:50,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:53:50,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:53:50,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:53:50,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:53:50,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:53:50,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:53:50,069 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:53:50,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:53:50,071 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:53:50,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:53:50,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:53:50,071 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:53:50,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:53:50,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:53:50,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:53:50,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:53:50,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:53:50,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:53:50,073 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:53:50,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:53:50,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:53:50,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:53:50,617 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:53:50,617 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:53:50,619 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-09-04 21:53:50,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e92a4088/e867a1c954fd49c9afab161d33de7ae2/FLAG671472b15 [2020-09-04 21:53:51,300 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:53:51,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-09-04 21:53:51,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e92a4088/e867a1c954fd49c9afab161d33de7ae2/FLAG671472b15 [2020-09-04 21:53:51,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e92a4088/e867a1c954fd49c9afab161d33de7ae2 [2020-09-04 21:53:51,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:53:51,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:53:51,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:53:51,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:53:51,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:53:51,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:53:51" (1/1) ... [2020-09-04 21:53:51,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481c894b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51, skipping insertion in model container [2020-09-04 21:53:51,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:53:51" (1/1) ... [2020-09-04 21:53:51,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:53:51,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:53:51,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:53:51,959 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:53:51,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:53:51,996 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:53:51,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51 WrapperNode [2020-09-04 21:53:51,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:53:51,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:53:51,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:53:51,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:53:52,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51" (1/1) ... [2020-09-04 21:53:52,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51" (1/1) ... [2020-09-04 21:53:52,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51" (1/1) ... [2020-09-04 21:53:52,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51" (1/1) ... [2020-09-04 21:53:52,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51" (1/1) ... [2020-09-04 21:53:52,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51" (1/1) ... [2020-09-04 21:53:52,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51" (1/1) ... [2020-09-04 21:53:52,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:53:52,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:53:52,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:53:52,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:53:52,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51" (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:53:52,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:53:52,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:53:52,254 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 21:53:52,254 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 21:53:52,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:53:52,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:53:52,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:53:52,255 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 21:53:52,255 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 21:53:52,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:53:52,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:53:52,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:53:52,510 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:53:52,510 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:53:52,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:53:52 BoogieIcfgContainer [2020-09-04 21:53:52,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:53:52,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:53:52,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:53:52,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:53:52,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:53:51" (1/3) ... [2020-09-04 21:53:52,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dfd35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:53:52, skipping insertion in model container [2020-09-04 21:53:52,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:53:51" (2/3) ... [2020-09-04 21:53:52,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dfd35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:53:52, skipping insertion in model container [2020-09-04 21:53:52,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:53:52" (3/3) ... [2020-09-04 21:53:52,540 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2020-09-04 21:53:52,554 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:53:52,567 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:53:52,590 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:53:52,621 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:53:52,621 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:53:52,621 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:53:52,621 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:53:52,622 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:53:52,622 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:53:52,622 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:53:52,622 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:53:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-09-04 21:53:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:53:52,657 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:52,659 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:53:52,659 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:52,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:52,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-09-04 21:53:52,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:52,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1331219711] [2020-09-04 21:53:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:52,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:52,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:52,921 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:53:52,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1331219711] [2020-09-04 21:53:52,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:53:52,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:53:52,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915047836] [2020-09-04 21:53:52,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:53:52,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:52,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:53:52,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:53:52,977 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-09-04 21:53:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:53,166 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-09-04 21:53:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:53:53,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:53:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:53,184 INFO L225 Difference]: With dead ends: 58 [2020-09-04 21:53:53,184 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 21:53:53,189 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:53:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 21:53:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 21:53:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:53:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:53:53,261 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-09-04 21:53:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:53,262 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:53:53,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:53:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:53:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 21:53:53,265 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:53,265 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:53:53,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:53:53,266 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-09-04 21:53:53,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:53,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1677565596] [2020-09-04 21:53:53,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,344 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:53:53,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1677565596] [2020-09-04 21:53:53,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:53:53,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:53:53,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386998597] [2020-09-04 21:53:53,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:53:53,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:53,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:53:53,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:53:53,350 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-09-04 21:53:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:53,432 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 21:53:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:53:53,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 21:53:53,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:53,436 INFO L225 Difference]: With dead ends: 50 [2020-09-04 21:53:53,436 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 21:53:53,438 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:53:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 21:53:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 21:53:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:53:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 21:53:53,461 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-09-04 21:53:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:53,461 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 21:53:53,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:53:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 21:53:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 21:53:53,465 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:53,465 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:53,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:53:53,467 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:53,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-09-04 21:53:53,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:53,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1858110648] [2020-09-04 21:53:53,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:53:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 21:53:53,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1858110648] [2020-09-04 21:53:53,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:53,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:53:53,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874958116] [2020-09-04 21:53:53,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:53:53,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:53,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:53:53,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:53,677 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-09-04 21:53:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:53,796 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-09-04 21:53:53,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:53:53,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 21:53:53,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:53,799 INFO L225 Difference]: With dead ends: 82 [2020-09-04 21:53:53,799 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 21:53:53,801 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 21:53:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-04 21:53:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 21:53:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 21:53:53,818 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-09-04 21:53:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:53,819 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 21:53:53,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:53:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 21:53:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:53:53,822 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:53,822 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:53,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:53:53,823 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:53,824 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-09-04 21:53:53,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:53,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [429173827] [2020-09-04 21:53:53,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 21:53:53,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [429173827] [2020-09-04 21:53:53,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:53,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:53:53,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111811041] [2020-09-04 21:53:53,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:53:53,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:53,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:53:53,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:53,977 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-09-04 21:53:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:54,229 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-09-04 21:53:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:53:54,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-09-04 21:53:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:54,233 INFO L225 Difference]: With dead ends: 74 [2020-09-04 21:53:54,233 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 21:53:54,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:53:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 21:53:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-09-04 21:53:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 21:53:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-09-04 21:53:54,253 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-09-04 21:53:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:54,253 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-09-04 21:53:54,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:53:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-09-04 21:53:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 21:53:54,257 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:54,257 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:54,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:53:54,257 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:54,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:54,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-09-04 21:53:54,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:54,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1179169675] [2020-09-04 21:53:54,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:53:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 21:53:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 21:53:54,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1179169675] [2020-09-04 21:53:54,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:54,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:53:54,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509428708] [2020-09-04 21:53:54,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:53:54,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:54,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:53:54,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:53:54,414 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-09-04 21:53:54,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:54,512 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-09-04 21:53:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:53:54,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-09-04 21:53:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:54,515 INFO L225 Difference]: With dead ends: 130 [2020-09-04 21:53:54,515 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:53:54,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:53:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:53:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 21:53:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:53:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-09-04 21:53:54,535 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-09-04 21:53:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:54,535 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-09-04 21:53:54,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:53:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-09-04 21:53:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:53:54,538 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:54,539 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:54,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:53:54,539 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-09-04 21:53:54,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:54,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1747486418] [2020-09-04 21:53:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 21:53:54,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1747486418] [2020-09-04 21:53:54,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:54,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:54,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325625055] [2020-09-04 21:53:54,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:54,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:54,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:54,825 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-09-04 21:53:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:54,970 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-09-04 21:53:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:53:54,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 21:53:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:54,975 INFO L225 Difference]: With dead ends: 142 [2020-09-04 21:53:54,978 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:53:54,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:54,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:53:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-09-04 21:53:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 21:53:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-09-04 21:53:55,000 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-09-04 21:53:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:55,001 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-09-04 21:53:55,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-09-04 21:53:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:53:55,004 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:55,004 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:55,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:53:55,005 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-09-04 21:53:55,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:55,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1539589062] [2020-09-04 21:53:55,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 21:53:55,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1539589062] [2020-09-04 21:53:55,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:55,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:55,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806987019] [2020-09-04 21:53:55,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:55,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:55,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:55,176 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-09-04 21:53:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:55,394 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-09-04 21:53:55,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:53:55,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-04 21:53:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:55,398 INFO L225 Difference]: With dead ends: 118 [2020-09-04 21:53:55,398 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 21:53:55,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:53:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 21:53:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-09-04 21:53:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-09-04 21:53:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-09-04 21:53:55,428 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-09-04 21:53:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:55,428 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-09-04 21:53:55,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-09-04 21:53:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 21:53:55,432 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:55,432 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:55,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:53:55,433 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-09-04 21:53:55,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:55,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [576015833] [2020-09-04 21:53:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 21:53:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 21:53:55,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [576015833] [2020-09-04 21:53:55,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:55,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:53:55,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142323527] [2020-09-04 21:53:55,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:53:55,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:55,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:53:55,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:53:55,616 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-09-04 21:53:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:55,778 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-09-04 21:53:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:53:55,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-09-04 21:53:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:55,782 INFO L225 Difference]: With dead ends: 227 [2020-09-04 21:53:55,782 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 21:53:55,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 21:53:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-09-04 21:53:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 21:53:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-09-04 21:53:55,810 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-09-04 21:53:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:55,811 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-09-04 21:53:55,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:53:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-09-04 21:53:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 21:53:55,813 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:55,814 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:55,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:53:55,814 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-09-04 21:53:55,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:55,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1837866489] [2020-09-04 21:53:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:55,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 21:53:56,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1837866489] [2020-09-04 21:53:56,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:56,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:53:56,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398548249] [2020-09-04 21:53:56,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:53:56,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:56,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:53:56,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:56,047 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-09-04 21:53:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:56,361 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-09-04 21:53:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:53:56,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 21:53:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:56,367 INFO L225 Difference]: With dead ends: 257 [2020-09-04 21:53:56,367 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 21:53:56,369 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:53:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 21:53:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-09-04 21:53:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 21:53:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-09-04 21:53:56,396 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-09-04 21:53:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:56,397 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-09-04 21:53:56,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:53:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-09-04 21:53:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 21:53:56,400 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:56,400 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:56,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:53:56,401 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-09-04 21:53:56,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:56,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832846067] [2020-09-04 21:53:56,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-09-04 21:53:56,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832846067] [2020-09-04 21:53:56,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:56,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:53:56,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552720824] [2020-09-04 21:53:56,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:53:56,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:56,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:53:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:53:56,734 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-09-04 21:53:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:57,263 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-09-04 21:53:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:53:57,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-09-04 21:53:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:57,268 INFO L225 Difference]: With dead ends: 265 [2020-09-04 21:53:57,269 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 21:53:57,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:53:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 21:53:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-09-04 21:53:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 21:53:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-09-04 21:53:57,290 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-09-04 21:53:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:57,291 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-09-04 21:53:57,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:53:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-09-04 21:53:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:53:57,293 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:57,293 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:57,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:53:57,294 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:57,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:57,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-09-04 21:53:57,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:57,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [390167095] [2020-09-04 21:53:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 21:53:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 67 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-09-04 21:53:57,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [390167095] [2020-09-04 21:53:57,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:57,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:53:57,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881506315] [2020-09-04 21:53:57,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:53:57,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:57,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:53:57,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:57,606 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-09-04 21:53:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:57,840 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-09-04 21:53:57,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:53:57,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-09-04 21:53:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:57,843 INFO L225 Difference]: With dead ends: 193 [2020-09-04 21:53:57,844 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 21:53:57,845 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:53:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 21:53:57,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 21:53:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 21:53:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-09-04 21:53:57,863 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-09-04 21:53:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:57,864 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-09-04 21:53:57,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:53:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-09-04 21:53:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:53:57,867 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:57,867 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:57,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:53:57,868 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-09-04 21:53:57,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:57,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [126468518] [2020-09-04 21:53:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:57,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 21:53:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 72 proven. 111 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2020-09-04 21:53:58,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [126468518] [2020-09-04 21:53:58,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:58,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:53:58,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970351073] [2020-09-04 21:53:58,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:53:58,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:58,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:53:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:53:58,385 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-09-04 21:53:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:58,903 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-09-04 21:53:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 21:53:58,904 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-09-04 21:53:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:58,908 INFO L225 Difference]: With dead ends: 241 [2020-09-04 21:53:58,909 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 21:53:58,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:53:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 21:53:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-09-04 21:53:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 21:53:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-09-04 21:53:58,939 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-09-04 21:53:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:58,940 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-09-04 21:53:58,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:53:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-09-04 21:53:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:53:58,943 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:58,943 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:58,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:53:58,944 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:58,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-09-04 21:53:58,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:58,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1942043329] [2020-09-04 21:53:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:53:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:53:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:53:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:53:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 26 proven. 126 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2020-09-04 21:53:59,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1942043329] [2020-09-04 21:53:59,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:53:59,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:53:59,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260535278] [2020-09-04 21:53:59,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:53:59,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:53:59,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:53:59,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:53:59,309 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 10 states. [2020-09-04 21:53:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:53:59,607 INFO L93 Difference]: Finished difference Result 244 states and 326 transitions. [2020-09-04 21:53:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:53:59,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2020-09-04 21:53:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:53:59,612 INFO L225 Difference]: With dead ends: 244 [2020-09-04 21:53:59,612 INFO L226 Difference]: Without dead ends: 238 [2020-09-04 21:53:59,614 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:53:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-04 21:53:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2020-09-04 21:53:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-09-04 21:53:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 287 transitions. [2020-09-04 21:53:59,649 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 287 transitions. Word has length 140 [2020-09-04 21:53:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:53:59,650 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 287 transitions. [2020-09-04 21:53:59,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:53:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 287 transitions. [2020-09-04 21:53:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-04 21:53:59,653 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:53:59,654 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:53:59,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:53:59,654 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:53:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:53:59,655 INFO L82 PathProgramCache]: Analyzing trace with hash -88380307, now seen corresponding path program 3 times [2020-09-04 21:53:59,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:53:59,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263681870] [2020-09-04 21:53:59,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:53:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:53:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:53:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:53:59,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:53:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:54:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 179 proven. 163 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-09-04 21:54:00,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263681870] [2020-09-04 21:54:00,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:00,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:54:00,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464068239] [2020-09-04 21:54:00,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:54:00,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:54:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:54:00,227 INFO L87 Difference]: Start difference. First operand 213 states and 287 transitions. Second operand 14 states. [2020-09-04 21:54:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:00,818 INFO L93 Difference]: Finished difference Result 470 states and 677 transitions. [2020-09-04 21:54:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:54:00,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 193 [2020-09-04 21:54:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:00,825 INFO L225 Difference]: With dead ends: 470 [2020-09-04 21:54:00,825 INFO L226 Difference]: Without dead ends: 257 [2020-09-04 21:54:00,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:54:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-09-04 21:54:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2020-09-04 21:54:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-09-04 21:54:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 310 transitions. [2020-09-04 21:54:00,867 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 310 transitions. Word has length 193 [2020-09-04 21:54:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:00,868 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 310 transitions. [2020-09-04 21:54:00,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:54:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 310 transitions. [2020-09-04 21:54:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-09-04 21:54:00,875 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:00,875 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:00,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:54:00,876 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:00,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1293350858, now seen corresponding path program 4 times [2020-09-04 21:54:00,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:00,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1801882600] [2020-09-04 21:54:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:00,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 21:54:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2292 backedges. 199 proven. 672 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2020-09-04 21:54:01,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1801882600] [2020-09-04 21:54:01,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:01,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:54:01,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13838824] [2020-09-04 21:54:01,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:54:01,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:01,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:54:01,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:54:01,858 INFO L87 Difference]: Start difference. First operand 233 states and 310 transitions. Second operand 14 states. [2020-09-04 21:54:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:02,516 INFO L93 Difference]: Finished difference Result 534 states and 785 transitions. [2020-09-04 21:54:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:54:02,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 351 [2020-09-04 21:54:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:02,524 INFO L225 Difference]: With dead ends: 534 [2020-09-04 21:54:02,524 INFO L226 Difference]: Without dead ends: 301 [2020-09-04 21:54:02,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:54:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-09-04 21:54:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 265. [2020-09-04 21:54:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-09-04 21:54:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 352 transitions. [2020-09-04 21:54:02,570 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 352 transitions. Word has length 351 [2020-09-04 21:54:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:02,570 INFO L479 AbstractCegarLoop]: Abstraction has 265 states and 352 transitions. [2020-09-04 21:54:02,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:54:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 352 transitions. [2020-09-04 21:54:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-09-04 21:54:02,575 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:02,576 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:02,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:54:02,576 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2113087688, now seen corresponding path program 5 times [2020-09-04 21:54:02,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:02,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427077485] [2020-09-04 21:54:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:02,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:54:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 261 proven. 446 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2020-09-04 21:54:03,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427077485] [2020-09-04 21:54:03,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:03,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:54:03,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992453944] [2020-09-04 21:54:03,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:54:03,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:03,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:54:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:54:03,344 INFO L87 Difference]: Start difference. First operand 265 states and 352 transitions. Second operand 16 states. [2020-09-04 21:54:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:04,202 INFO L93 Difference]: Finished difference Result 487 states and 692 transitions. [2020-09-04 21:54:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 21:54:04,202 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 281 [2020-09-04 21:54:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:04,208 INFO L225 Difference]: With dead ends: 487 [2020-09-04 21:54:04,208 INFO L226 Difference]: Without dead ends: 190 [2020-09-04 21:54:04,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 21:54:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-09-04 21:54:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2020-09-04 21:54:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-09-04 21:54:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 209 transitions. [2020-09-04 21:54:04,232 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 209 transitions. Word has length 281 [2020-09-04 21:54:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:04,232 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 209 transitions. [2020-09-04 21:54:04,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:54:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 209 transitions. [2020-09-04 21:54:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-04 21:54:04,236 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:04,236 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:04,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:54:04,237 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1117162661, now seen corresponding path program 6 times [2020-09-04 21:54:04,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:04,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [916759192] [2020-09-04 21:54:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:04,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:54:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2020-09-04 21:54:05,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [916759192] [2020-09-04 21:54:05,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:05,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-09-04 21:54:05,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185622958] [2020-09-04 21:54:05,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 21:54:05,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:05,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 21:54:05,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:54:05,826 INFO L87 Difference]: Start difference. First operand 163 states and 209 transitions. Second operand 28 states. [2020-09-04 21:54:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:07,152 INFO L93 Difference]: Finished difference Result 175 states and 223 transitions. [2020-09-04 21:54:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-09-04 21:54:07,153 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 228 [2020-09-04 21:54:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:07,156 INFO L225 Difference]: With dead ends: 175 [2020-09-04 21:54:07,159 INFO L226 Difference]: Without dead ends: 169 [2020-09-04 21:54:07,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=2579, Unknown=0, NotChecked=0, Total=2756 [2020-09-04 21:54:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-09-04 21:54:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2020-09-04 21:54:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-09-04 21:54:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 208 transitions. [2020-09-04 21:54:07,180 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 208 transitions. Word has length 228 [2020-09-04 21:54:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:07,181 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 208 transitions. [2020-09-04 21:54:07,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 21:54:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 208 transitions. [2020-09-04 21:54:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2020-09-04 21:54:07,190 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:07,191 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 22, 22, 21, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:07,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 21:54:07,191 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:07,192 INFO L82 PathProgramCache]: Analyzing trace with hash -828157958, now seen corresponding path program 7 times [2020-09-04 21:54:07,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:07,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [39050911] [2020-09-04 21:54:07,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 21:54:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2020-09-04 21:54:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 21:54:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:07,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3406 backedges. 242 proven. 590 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2020-09-04 21:54:08,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [39050911] [2020-09-04 21:54:08,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:08,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:54:08,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766243750] [2020-09-04 21:54:08,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:54:08,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:54:08,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:54:08,194 INFO L87 Difference]: Start difference. First operand 163 states and 208 transitions. Second operand 11 states. [2020-09-04 21:54:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:08,534 INFO L93 Difference]: Finished difference Result 316 states and 416 transitions. [2020-09-04 21:54:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:54:08,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 423 [2020-09-04 21:54:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:08,538 INFO L225 Difference]: With dead ends: 316 [2020-09-04 21:54:08,538 INFO L226 Difference]: Without dead ends: 162 [2020-09-04 21:54:08,540 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:54:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-04 21:54:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2020-09-04 21:54:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-09-04 21:54:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 201 transitions. [2020-09-04 21:54:08,563 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 201 transitions. Word has length 423 [2020-09-04 21:54:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:08,563 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 201 transitions. [2020-09-04 21:54:08,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:54:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 201 transitions. [2020-09-04 21:54:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2020-09-04 21:54:08,566 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:08,566 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 15, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:08,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 21:54:08,567 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:08,567 INFO L82 PathProgramCache]: Analyzing trace with hash 689403166, now seen corresponding path program 8 times [2020-09-04 21:54:08,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:08,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673620955] [2020-09-04 21:54:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:08,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:54:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-09-04 21:54:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2049 backedges. 268 proven. 558 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2020-09-04 21:54:09,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673620955] [2020-09-04 21:54:09,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:09,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:54:09,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944668826] [2020-09-04 21:54:09,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:54:09,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:54:09,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:54:09,407 INFO L87 Difference]: Start difference. First operand 159 states and 201 transitions. Second operand 14 states. [2020-09-04 21:54:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:09,988 INFO L93 Difference]: Finished difference Result 321 states and 420 transitions. [2020-09-04 21:54:09,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:54:09,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 334 [2020-09-04 21:54:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:09,992 INFO L225 Difference]: With dead ends: 321 [2020-09-04 21:54:09,993 INFO L226 Difference]: Without dead ends: 172 [2020-09-04 21:54:09,995 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:54:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-09-04 21:54:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2020-09-04 21:54:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-09-04 21:54:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2020-09-04 21:54:10,016 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 334 [2020-09-04 21:54:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:10,017 INFO L479 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2020-09-04 21:54:10,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:54:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2020-09-04 21:54:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-09-04 21:54:10,022 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:10,022 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:10,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 21:54:10,023 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:10,024 INFO L82 PathProgramCache]: Analyzing trace with hash 549243331, now seen corresponding path program 9 times [2020-09-04 21:54:10,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:10,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1745616338] [2020-09-04 21:54:10,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:54:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:54:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:10,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2534 backedges. 186 proven. 556 refuted. 0 times theorem prover too weak. 1792 trivial. 0 not checked. [2020-09-04 21:54:11,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1745616338] [2020-09-04 21:54:11,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:11,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 21:54:11,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498670318] [2020-09-04 21:54:11,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 21:54:11,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:11,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 21:54:11,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:54:11,049 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand 12 states. [2020-09-04 21:54:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:11,435 INFO L93 Difference]: Finished difference Result 193 states and 246 transitions. [2020-09-04 21:54:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:54:11,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 369 [2020-09-04 21:54:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:11,437 INFO L225 Difference]: With dead ends: 193 [2020-09-04 21:54:11,437 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:54:11,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:54:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:54:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:54:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:54:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:54:11,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 369 [2020-09-04 21:54:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:11,442 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:54:11,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 21:54:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:54:11,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:54:11,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 21:54:11,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:54:35,010 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 6 [2020-09-04 21:54:35,544 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 38 [2020-09-04 21:54:35,930 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 29 [2020-09-04 21:54:36,061 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 6 [2020-09-04 21:54:36,439 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 29 [2020-09-04 21:54:37,680 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 170 DAG size of output: 39 [2020-09-04 21:54:38,125 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 34 [2020-09-04 21:54:38,668 WARN L193 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 38 [2020-09-04 21:54:39,262 WARN L193 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 39 [2020-09-04 21:54:39,461 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 6 [2020-09-04 21:54:40,046 WARN L193 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 39 [2020-09-04 21:54:40,554 WARN L193 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 44 [2020-09-04 21:54:41,099 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 32 [2020-09-04 21:54:41,675 WARN L193 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 32 [2020-09-04 21:54:41,781 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 6 [2020-09-04 21:54:41,900 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 7 [2020-09-04 21:54:42,283 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 26 [2020-09-04 21:54:43,493 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 170 DAG size of output: 39 [2020-09-04 21:54:43,877 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 26 [2020-09-04 21:54:43,992 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 8 [2020-09-04 21:54:44,664 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 37 [2020-09-04 21:54:44,792 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 6 [2020-09-04 21:54:45,389 WARN L193 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 30 [2020-09-04 21:54:45,484 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:54:45,484 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:54:45,484 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:54:45,484 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:54:45,485 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:54:45,485 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:54:45,485 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-09-04 21:54:45,485 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-09-04 21:54:45,485 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 6 main_~x~0) [2020-09-04 21:54:45,486 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 6 main_~x~0) [2020-09-04 21:54:45,486 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-09-04 21:54:45,486 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-09-04 21:54:45,486 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6)) [2020-09-04 21:54:45,487 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 8 |main_#t~ret4|) (<= 6 main_~x~0) (<= |main_#t~ret4| 8) (<= main_~x~0 6)) [2020-09-04 21:54:45,487 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 6 main_~x~0) [2020-09-04 21:54:45,487 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 8 |main_#t~ret4|) (<= 6 main_~x~0) (<= |main_#t~ret4| 8) (<= main_~x~0 6)) [2020-09-04 21:54:45,487 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 8 |main_#t~ret4|) (<= 6 main_~x~0) (<= |main_#t~ret4| 8) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-09-04 21:54:45,487 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-09-04 21:54:45,488 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= 2 |fibo2_#in~n|)) [2020-09-04 21:54:45,488 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 3) .cse0 (<= 5 |fibo2_#in~n|)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 |fibo2_#in~n|) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) .cse0 (<= fibo2_~n 4)))) (not (<= |fibo2_#in~n| 1))) [2020-09-04 21:54:45,488 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= 2 |fibo2_#in~n|)) (< 0 fibo2_~n)) [2020-09-04 21:54:45,488 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 3) .cse0 (<= 5 |fibo2_#in~n|)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 |fibo2_#in~n|) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) .cse0 (<= fibo2_~n 4)))) (not (<= |fibo2_#in~n| 1))) [2020-09-04 21:54:45,488 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-09-04 21:54:45,488 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse1 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= 3 |fibo2_#t~ret2|) (<= .cse1 5) (<= |fibo2_#t~ret2| 3) (<= 5 .cse1) .cse0) (and (<= |fibo2_#in~n| 4) .cse0))) (or (and (<= 4 |fibo2_#in~n|) (<= .cse1 3) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) (<= 3 .cse1)) (<= 5 |fibo2_#in~n|) (and (<= 1 .cse1) (<= .cse1 1) (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2))) (not (<= |fibo2_#in~n| 1)))) [2020-09-04 21:54:45,488 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-09-04 21:54:45,489 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse1 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= 3 |fibo2_#t~ret2|) (<= .cse1 5) (<= |fibo2_#t~ret2| 3) (<= 5 .cse1) .cse0) (and (<= |fibo2_#in~n| 4) .cse0))) (or (and (<= 4 |fibo2_#in~n|) (<= .cse1 3) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) (<= 3 .cse1)) (<= 5 |fibo2_#in~n|) (and (<= 1 .cse1) (<= .cse1 1) (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2))) (not (<= |fibo2_#in~n| 1)))) [2020-09-04 21:54:45,489 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-09-04 21:54:45,489 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (and (let ((.cse1 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= 1 .cse1) (<= .cse1 1) (<= 1 |fibo2_#res|) (<= |fibo2_#t~ret2| 1) (<= |fibo2_#res| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 2)) (and (<= 4 |fibo2_#in~n|) (<= .cse1 3) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 4) (<= 3 |fibo2_#res|) (<= |fibo2_#t~ret2| 2) (<= |fibo2_#res| 3) .cse0 (<= 3 .cse1)) (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#res| 5) (<= .cse1 5) (<= |fibo2_#t~ret2| 3) (<= 5 .cse1) .cse0 (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)))) (not (<= |fibo2_#in~n| 1))) [2020-09-04 21:54:45,489 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= 4 |fibo2_#in~n|) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 4) (<= 3 |fibo2_#res|) (<= |fibo2_#t~ret2| 2) (<= |fibo2_#res| 3) .cse0) (and (<= 1 |fibo2_#res|) (<= |fibo2_#t~ret2| 1) (<= |fibo2_#res| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)) (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#res| 5) (<= |fibo2_#t~ret2| 3) .cse0 (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)))) [2020-09-04 21:54:45,489 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (and (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n)) (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#res| 5) .cse0 (<= 5 |fibo2_#res|)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#in~n| 4) .cse0))) (or (<= |fibo2_#in~n| 0) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1)) (not (<= |fibo2_#in~n| 3))) (or (not (<= 3 |fibo2_#in~n|)) (and (<= |fibo2_#res| 3) (<= 3 |fibo2_#res|)) (<= 5 |fibo2_#in~n|))) [2020-09-04 21:54:45,490 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (and (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n)) (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#res| 5) .cse0 (<= 5 |fibo2_#res|)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#in~n| 4) .cse0))) (or (<= |fibo2_#in~n| 0) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1)) (not (<= |fibo2_#in~n| 3))) (or (not (<= 3 |fibo2_#in~n|)) (and (<= |fibo2_#res| 3) (<= 3 |fibo2_#res|)) (<= 5 |fibo2_#in~n|))) [2020-09-04 21:54:45,490 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-09-04 21:54:45,490 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 21:54:45,490 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 5) (<= 5 fibo1_~n) .cse0) (and (<= 5 |fibo1_#in~n|) (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-09-04 21:54:45,490 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 21:54:45,490 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 5) (<= 5 fibo1_~n) .cse0) (and (<= 5 |fibo1_#in~n|) (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-09-04 21:54:45,490 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (and (or (not (<= 2 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2)) (<= 7 |fibo1_#in~n|) (and (<= 5 fibo1_~n) (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8))))) (or (<= |fibo1_#in~n| 0) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (not (<= |fibo1_#in~n| 2))) (= fibo1_~n |fibo1_#in~n|) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 21:54:45,490 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 21:54:45,491 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= .cse0 2) (<= 1 |fibo1_#t~ret0|) (<= 2 .cse0) .cse1 (<= 3 |fibo1_#in~n|)) (and (or (and (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse1 (<= 8 .cse0) (<= .cse0 8)) (and (<= |fibo1_#in~n| 5) .cse1)) (<= 5 fibo1_~n)) (and (<= 7 |fibo1_#in~n|) .cse1))) [2020-09-04 21:54:45,491 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 21:54:45,491 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= .cse0 2) (<= 1 |fibo1_#t~ret0|) (<= 2 .cse0) .cse1 (<= 3 |fibo1_#in~n|)) (and (or (and (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse1 (<= 8 .cse0) (<= .cse0 8)) (and (<= |fibo1_#in~n| 5) .cse1)) (<= 5 fibo1_~n)) (and (<= 7 |fibo1_#in~n|) .cse1))) [2020-09-04 21:54:45,491 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-09-04 21:54:45,491 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (or (and (<= |fibo1_#in~n| 5) .cse0) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8) (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse0 (<= 8 .cse1) (<= .cse1 8))) (<= 5 fibo1_~n)) (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) (<= |fibo1_#t~ret0| 1) (<= .cse1 2) (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#res| 2) (<= 2 .cse1) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= 7 |fibo1_#in~n|) .cse0))) [2020-09-04 21:54:45,494 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#res| 2) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= 5 fibo1_~n) .cse0 (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8) (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5)))) (and (<= 7 |fibo1_#in~n|) .cse0))) [2020-09-04 21:54:45,494 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (and (or (not (<= 2 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2)) (<= 7 |fibo1_#in~n|) (and (<= 5 fibo1_~n) (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8))))) (or (<= |fibo1_#in~n| 0) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (not (<= |fibo1_#in~n| 2))) (= fibo1_~n |fibo1_#in~n|) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 21:54:45,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:54:45 BoogieIcfgContainer [2020-09-04 21:54:45,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:54:45,535 INFO L168 Benchmark]: Toolchain (without parser) took 53880.69 ms. Allocated memory was 137.9 MB in the beginning and 902.3 MB in the end (delta: 764.4 MB). Free memory was 102.7 MB in the beginning and 493.3 MB in the end (delta: -390.7 MB). Peak memory consumption was 787.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:45,536 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 137.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 21:54:45,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.11 ms. Allocated memory is still 137.9 MB. Free memory was 102.2 MB in the beginning and 93.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:45,539 INFO L168 Benchmark]: Boogie Preprocessor took 141.28 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 92.8 MB in the beginning and 181.9 MB in the end (delta: -89.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:45,539 INFO L168 Benchmark]: RCFGBuilder took 381.43 ms. Allocated memory is still 202.9 MB. Free memory was 181.9 MB in the beginning and 167.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:45,540 INFO L168 Benchmark]: TraceAbstraction took 53004.09 ms. Allocated memory was 202.9 MB in the beginning and 902.3 MB in the end (delta: 699.4 MB). Free memory was 166.4 MB in the beginning and 493.3 MB in the end (delta: -327.0 MB). Peak memory consumption was 785.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:54:45,542 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.32 ms. Allocated memory is still 137.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.11 ms. Allocated memory is still 137.9 MB. Free memory was 102.2 MB in the beginning and 93.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.28 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 92.8 MB in the beginning and 181.9 MB in the end (delta: -89.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 381.43 ms. Allocated memory is still 202.9 MB. Free memory was 181.9 MB in the beginning and 167.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53004.09 ms. Allocated memory was 202.9 MB in the beginning and 902.3 MB in the end (delta: 699.4 MB). Free memory was 166.4 MB in the beginning and 493.3 MB in the end (delta: -327.0 MB). Peak memory consumption was 785.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 6 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((((\result <= 0 && 0 <= \result) || 0 < n) && ((((\result <= 5 && n == \old(n)) && 5 <= \result) || (n == \old(n) && 6 <= \old(n))) || (\old(n) <= 4 && n == \old(n)))) && ((\old(n) <= 0 || (1 <= \result && \result <= 1)) || !(\old(n) <= 3))) && ((!(3 <= \old(n)) || (\result <= 3 && 3 <= \result)) || 5 <= \old(n)) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((!(2 <= \old(n)) || ((\old(n) <= 3 && 2 <= \result) && \result <= 2)) || 7 <= \old(n)) || (5 <= n && (\old(n) <= 5 || (8 <= \result && \result <= 8)))) && ((\old(n) <= 0 || (\result <= 1 && 1 <= \result)) || !(\old(n) <= 2))) && n == \old(n)) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.8s, OverallIterations: 20, TraceHistogramMax: 25, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 34.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1013 SDtfs, 1122 SDslu, 6956 SDs, 0 SdLazy, 5029 SolverSat, 456 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 214 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3937 PreInvPairs, 9525 NumberOfFragments, 1229 HoareAnnotationTreeSize, 3937 FomulaSimplifications, 359977 FormulaSimplificationTreeSizeReduction, 23.3s HoareSimplificationTime, 45 FomulaSimplificationsInter, 81078 FormulaSimplificationTreeSizeReductionInter, 10.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 3079 NumberOfCodeBlocks, 3079 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3059 ConstructedInterpolants, 0 QuantifiedInterpolants, 1328317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 10600/14330 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...