/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:28:34,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:28:34,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:28:34,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:28:34,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:28:34,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:28:34,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:28:34,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:28:34,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:28:34,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:28:34,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:28:34,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:28:34,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:28:34,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:28:34,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:28:34,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:28:34,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:28:34,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:28:34,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:28:34,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:28:34,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:28:34,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:28:34,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:28:34,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:28:34,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:28:34,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:28:34,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:28:34,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:28:34,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:28:34,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:28:34,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:28:34,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:28:34,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:28:34,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:28:34,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:28:34,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:28:34,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:28:34,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:28:34,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:28:34,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:28:34,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:28:34,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:28:34,190 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:28:34,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:28:34,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:28:34,194 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:28:34,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:28:34,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:28:34,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:28:34,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:28:34,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:28:34,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:28:34,196 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:28:34,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:28:34,196 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:28:34,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:28:34,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:28:34,197 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:28:34,197 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:28:34,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:28:34,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:28:34,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:28:34,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:28:34,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:28:34,198 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 20:28:34,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:28:34,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:28:34,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:28:34,655 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:28:34,655 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:28:34,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-10-23 20:28:34,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b96f14f8/a856e1188f2745318385dfa70917ec86/FLAG19654c564 [2020-10-23 20:28:35,379 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:28:35,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-10-23 20:28:35,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b96f14f8/a856e1188f2745318385dfa70917ec86/FLAG19654c564 [2020-10-23 20:28:35,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b96f14f8/a856e1188f2745318385dfa70917ec86 [2020-10-23 20:28:35,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:28:35,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:28:35,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:35,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:28:35,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:28:35,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:35" (1/1) ... [2020-10-23 20:28:35,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640a5218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:35, skipping insertion in model container [2020-10-23 20:28:35,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:35" (1/1) ... [2020-10-23 20:28:35,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:28:35,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:28:35,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:36,001 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:28:36,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:36,034 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:28:36,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36 WrapperNode [2020-10-23 20:28:36,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:36,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:28:36,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:28:36,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:28:36,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36" (1/1) ... [2020-10-23 20:28:36,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36" (1/1) ... [2020-10-23 20:28:36,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36" (1/1) ... [2020-10-23 20:28:36,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36" (1/1) ... [2020-10-23 20:28:36,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36" (1/1) ... [2020-10-23 20:28:36,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36" (1/1) ... [2020-10-23 20:28:36,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36" (1/1) ... [2020-10-23 20:28:36,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:28:36,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:28:36,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:28:36,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:28:36,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:28:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:28:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:28:36,151 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:28:36,151 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-10-23 20:28:36,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:28:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:28:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:28:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:28:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:28:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-10-23 20:28:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:28:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:28:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:28:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:28:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:28:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:28:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:28:36,397 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:28:36,398 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:28:36,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:36 BoogieIcfgContainer [2020-10-23 20:28:36,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:28:36,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:28:36,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:28:36,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:28:36,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:28:35" (1/3) ... [2020-10-23 20:28:36,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c96cb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:36, skipping insertion in model container [2020-10-23 20:28:36,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:36" (2/3) ... [2020-10-23 20:28:36,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c96cb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:36, skipping insertion in model container [2020-10-23 20:28:36,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:36" (3/3) ... [2020-10-23 20:28:36,411 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2020-10-23 20:28:36,425 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:28:36,431 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:28:36,451 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:28:36,510 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:28:36,511 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:28:36,511 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:28:36,511 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:28:36,511 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:28:36,511 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:28:36,512 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:28:36,512 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:28:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-10-23 20:28:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-23 20:28:36,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:36,565 INFO L422 BasicCegarLoop]: trace histogram [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-10-23 20:28:36,566 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:36,574 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-10-23 20:28:36,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:36,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271189388] [2020-10-23 20:28:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:36,686 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:36,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:36,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:28:37,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271189388] [2020-10-23 20:28:37,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:37,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:28:37,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015211030] [2020-10-23 20:28:37,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:28:37,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:37,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:28:37,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:28:37,068 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-10-23 20:28:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:37,405 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-10-23 20:28:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 20:28:37,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-23 20:28:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:37,419 INFO L225 Difference]: With dead ends: 52 [2020-10-23 20:28:37,419 INFO L226 Difference]: Without dead ends: 34 [2020-10-23 20:28:37,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:28:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-23 20:28:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-23 20:28:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-23 20:28:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-10-23 20:28:37,483 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-10-23 20:28:37,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:37,484 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-10-23 20:28:37,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:28:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-10-23 20:28:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-23 20:28:37,487 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:37,487 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:37,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:28:37,488 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:37,489 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-10-23 20:28:37,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:37,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [423374137] [2020-10-23 20:28:37,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:37,494 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:37,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:37,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:37,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-23 20:28:37,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [423374137] [2020-10-23 20:28:37,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:37,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:28:37,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276748840] [2020-10-23 20:28:37,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:28:37,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:37,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:28:37,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:28:37,691 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-10-23 20:28:38,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:38,024 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-10-23 20:28:38,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:28:38,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-10-23 20:28:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:38,027 INFO L225 Difference]: With dead ends: 46 [2020-10-23 20:28:38,027 INFO L226 Difference]: Without dead ends: 39 [2020-10-23 20:28:38,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:28:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-23 20:28:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-23 20:28:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-23 20:28:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-10-23 20:28:38,045 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-10-23 20:28:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:38,045 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-23 20:28:38,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:28:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-10-23 20:28:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-23 20:28:38,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:38,048 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:38,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:28:38,049 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-10-23 20:28:38,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:38,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [339079036] [2020-10-23 20:28:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:38,055 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-23 20:28:38,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [339079036] [2020-10-23 20:28:38,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:38,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:28:38,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383458422] [2020-10-23 20:28:38,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:28:38,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:38,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:28:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:28:38,258 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-10-23 20:28:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:38,583 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-10-23 20:28:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:28:38,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-10-23 20:28:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:38,585 INFO L225 Difference]: With dead ends: 51 [2020-10-23 20:28:38,585 INFO L226 Difference]: Without dead ends: 44 [2020-10-23 20:28:38,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:28:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-23 20:28:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-23 20:28:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-23 20:28:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-10-23 20:28:38,614 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-10-23 20:28:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:38,615 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-10-23 20:28:38,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:28:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-10-23 20:28:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-23 20:28:38,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:38,620 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:38,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:28:38,621 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-10-23 20:28:38,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:38,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465384448] [2020-10-23 20:28:38,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:38,632 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-23 20:28:38,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465384448] [2020-10-23 20:28:38,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:38,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:28:38,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555791122] [2020-10-23 20:28:38,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:28:38,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:38,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:28:38,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:28:38,882 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-10-23 20:28:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:39,246 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-10-23 20:28:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:28:39,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-10-23 20:28:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:39,249 INFO L225 Difference]: With dead ends: 56 [2020-10-23 20:28:39,249 INFO L226 Difference]: Without dead ends: 49 [2020-10-23 20:28:39,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:28:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-23 20:28:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-10-23 20:28:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-23 20:28:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-10-23 20:28:39,264 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-10-23 20:28:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:39,264 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-10-23 20:28:39,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:28:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-10-23 20:28:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 20:28:39,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:39,266 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:39,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:28:39,266 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-10-23 20:28:39,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:39,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1541292940] [2020-10-23 20:28:39,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:39,288 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:39,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:39,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:39,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:39,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:39,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:39,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-23 20:28:39,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1541292940] [2020-10-23 20:28:39,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:39,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:28:39,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220447277] [2020-10-23 20:28:39,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:28:39,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:39,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:28:39,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:28:39,493 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-10-23 20:28:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:39,970 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-10-23 20:28:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:28:39,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-10-23 20:28:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:39,973 INFO L225 Difference]: With dead ends: 61 [2020-10-23 20:28:39,973 INFO L226 Difference]: Without dead ends: 54 [2020-10-23 20:28:39,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:28:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-23 20:28:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-23 20:28:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-23 20:28:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-10-23 20:28:39,989 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-10-23 20:28:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:39,990 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-10-23 20:28:39,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:28:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-10-23 20:28:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-23 20:28:39,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:39,992 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:39,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:28:39,992 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:39,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-10-23 20:28:39,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:39,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [226500559] [2020-10-23 20:28:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:39,998 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-23 20:28:40,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [226500559] [2020-10-23 20:28:40,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:40,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:28:40,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281936589] [2020-10-23 20:28:40,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:28:40,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:40,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:28:40,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:28:40,233 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-10-23 20:28:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:40,801 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-10-23 20:28:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:28:40,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-10-23 20:28:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:40,803 INFO L225 Difference]: With dead ends: 66 [2020-10-23 20:28:40,804 INFO L226 Difference]: Without dead ends: 59 [2020-10-23 20:28:40,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:28:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-23 20:28:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-23 20:28:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-23 20:28:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-10-23 20:28:40,821 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-10-23 20:28:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:40,822 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-10-23 20:28:40,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:28:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-10-23 20:28:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:28:40,824 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:40,824 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:40,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:28:40,825 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-10-23 20:28:40,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:40,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1263212056] [2020-10-23 20:28:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:40,833 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:40,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-23 20:28:41,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1263212056] [2020-10-23 20:28:41,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:41,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:28:41,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697163595] [2020-10-23 20:28:41,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:28:41,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:28:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:28:41,119 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-10-23 20:28:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:41,733 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-10-23 20:28:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:28:41,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-10-23 20:28:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:41,736 INFO L225 Difference]: With dead ends: 71 [2020-10-23 20:28:41,737 INFO L226 Difference]: Without dead ends: 64 [2020-10-23 20:28:41,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:28:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-23 20:28:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-23 20:28:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-23 20:28:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-10-23 20:28:41,755 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-10-23 20:28:41,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:41,755 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-10-23 20:28:41,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:28:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-10-23 20:28:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-23 20:28:41,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:41,757 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:41,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:28:41,758 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:41,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:41,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-10-23 20:28:41,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:41,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970186640] [2020-10-23 20:28:41,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:41,764 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-23 20:28:42,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970186640] [2020-10-23 20:28:42,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:42,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:28:42,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305399280] [2020-10-23 20:28:42,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:28:42,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:28:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:28:42,249 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-10-23 20:28:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:42,912 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-10-23 20:28:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:28:42,913 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-10-23 20:28:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:42,914 INFO L225 Difference]: With dead ends: 76 [2020-10-23 20:28:42,915 INFO L226 Difference]: Without dead ends: 69 [2020-10-23 20:28:42,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:28:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-23 20:28:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-23 20:28:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-23 20:28:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-10-23 20:28:42,957 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-10-23 20:28:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:42,957 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-10-23 20:28:42,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:28:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-10-23 20:28:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-23 20:28:42,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:42,964 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:42,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:28:42,965 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-10-23 20:28:42,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:42,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [156133401] [2020-10-23 20:28:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:42,982 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-23 20:28:43,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [156133401] [2020-10-23 20:28:43,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:43,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:28:43,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98585737] [2020-10-23 20:28:43,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:28:43,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:43,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:28:43,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:28:43,451 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-10-23 20:28:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:44,181 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-10-23 20:28:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:28:44,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-10-23 20:28:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:44,183 INFO L225 Difference]: With dead ends: 81 [2020-10-23 20:28:44,183 INFO L226 Difference]: Without dead ends: 74 [2020-10-23 20:28:44,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:28:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-23 20:28:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-23 20:28:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-23 20:28:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-10-23 20:28:44,201 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-10-23 20:28:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:44,201 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-10-23 20:28:44,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:28:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-10-23 20:28:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-23 20:28:44,203 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:44,203 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:44,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:28:44,203 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:44,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:44,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-10-23 20:28:44,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:44,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1411519383] [2020-10-23 20:28:44,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:44,211 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-23 20:28:44,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1411519383] [2020-10-23 20:28:44,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:44,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:28:44,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365821989] [2020-10-23 20:28:44,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:28:44,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:28:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:28:44,642 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-10-23 20:28:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:45,336 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-10-23 20:28:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:28:45,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-10-23 20:28:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:45,338 INFO L225 Difference]: With dead ends: 86 [2020-10-23 20:28:45,338 INFO L226 Difference]: Without dead ends: 79 [2020-10-23 20:28:45,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:28:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-23 20:28:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-23 20:28:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-23 20:28:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-10-23 20:28:45,376 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-10-23 20:28:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:45,376 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-10-23 20:28:45,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:28:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-10-23 20:28:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-23 20:28:45,377 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:45,378 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:45,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:28:45,378 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:45,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-10-23 20:28:45,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:45,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [124293168] [2020-10-23 20:28:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:45,389 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-23 20:28:45,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [124293168] [2020-10-23 20:28:45,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:45,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-23 20:28:45,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069297899] [2020-10-23 20:28:45,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 20:28:45,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 20:28:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-23 20:28:45,999 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-10-23 20:28:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:46,755 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-10-23 20:28:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:28:46,755 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-10-23 20:28:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:46,756 INFO L225 Difference]: With dead ends: 91 [2020-10-23 20:28:46,757 INFO L226 Difference]: Without dead ends: 84 [2020-10-23 20:28:46,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-23 20:28:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-23 20:28:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-10-23 20:28:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-23 20:28:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-10-23 20:28:46,779 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-10-23 20:28:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:46,780 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-10-23 20:28:46,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 20:28:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-10-23 20:28:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-10-23 20:28:46,781 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:46,781 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:46,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:28:46,782 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-10-23 20:28:46,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:46,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [231193052] [2020-10-23 20:28:46,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:46,790 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-23 20:28:47,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [231193052] [2020-10-23 20:28:47,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:47,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-23 20:28:47,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729828298] [2020-10-23 20:28:47,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 20:28:47,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:47,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 20:28:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:28:47,359 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-10-23 20:28:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:48,153 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-10-23 20:28:48,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:28:48,154 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-10-23 20:28:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:48,156 INFO L225 Difference]: With dead ends: 96 [2020-10-23 20:28:48,156 INFO L226 Difference]: Without dead ends: 89 [2020-10-23 20:28:48,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-23 20:28:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-23 20:28:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-23 20:28:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-23 20:28:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-10-23 20:28:48,173 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-10-23 20:28:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:48,174 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-10-23 20:28:48,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 20:28:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-10-23 20:28:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-23 20:28:48,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:48,184 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:48,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:28:48,184 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-10-23 20:28:48,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:48,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [959961061] [2020-10-23 20:28:48,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:48,193 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-23 20:28:48,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [959961061] [2020-10-23 20:28:48,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:48,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-23 20:28:48,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620730265] [2020-10-23 20:28:48,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-23 20:28:48,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-23 20:28:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-23 20:28:48,830 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-10-23 20:28:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:49,739 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-10-23 20:28:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 20:28:49,740 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-10-23 20:28:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:49,742 INFO L225 Difference]: With dead ends: 101 [2020-10-23 20:28:49,742 INFO L226 Difference]: Without dead ends: 94 [2020-10-23 20:28:49,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 20:28:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-23 20:28:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-23 20:28:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-23 20:28:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-10-23 20:28:49,761 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-10-23 20:28:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:49,762 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-10-23 20:28:49,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-23 20:28:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-10-23 20:28:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-23 20:28:49,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:49,765 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:49,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:28:49,765 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:49,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:49,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-10-23 20:28:49,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:49,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109345731] [2020-10-23 20:28:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:49,775 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-23 20:28:50,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2109345731] [2020-10-23 20:28:50,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:50,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-23 20:28:50,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77121405] [2020-10-23 20:28:50,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 20:28:50,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 20:28:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:28:50,539 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-10-23 20:28:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:51,497 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-10-23 20:28:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 20:28:51,498 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-10-23 20:28:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:51,500 INFO L225 Difference]: With dead ends: 106 [2020-10-23 20:28:51,500 INFO L226 Difference]: Without dead ends: 99 [2020-10-23 20:28:51,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 20:28:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-23 20:28:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-10-23 20:28:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-23 20:28:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-10-23 20:28:51,515 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-10-23 20:28:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:51,516 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-10-23 20:28:51,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 20:28:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-10-23 20:28:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-23 20:28:51,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:51,518 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:51,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:28:51,519 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-10-23 20:28:51,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:51,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1816877744] [2020-10-23 20:28:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:51,525 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-23 20:28:52,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1816877744] [2020-10-23 20:28:52,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:52,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-23 20:28:52,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253574774] [2020-10-23 20:28:52,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 20:28:52,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 20:28:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:28:52,310 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-10-23 20:28:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:53,356 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-10-23 20:28:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 20:28:53,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-10-23 20:28:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:53,358 INFO L225 Difference]: With dead ends: 111 [2020-10-23 20:28:53,359 INFO L226 Difference]: Without dead ends: 104 [2020-10-23 20:28:53,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-23 20:28:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-23 20:28:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-23 20:28:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-23 20:28:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-10-23 20:28:53,382 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-10-23 20:28:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:53,386 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-10-23 20:28:53,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 20:28:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-10-23 20:28:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-10-23 20:28:53,388 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:53,388 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:53,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:28:53,388 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:53,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:53,389 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-10-23 20:28:53,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:53,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1029822002] [2020-10-23 20:28:53,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:53,400 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-23 20:28:54,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1029822002] [2020-10-23 20:28:54,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:54,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-10-23 20:28:54,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934814095] [2020-10-23 20:28:54,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-23 20:28:54,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-23 20:28:54,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:28:54,339 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2020-10-23 20:28:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:55,436 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-10-23 20:28:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 20:28:55,437 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-10-23 20:28:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:55,439 INFO L225 Difference]: With dead ends: 116 [2020-10-23 20:28:55,439 INFO L226 Difference]: Without dead ends: 109 [2020-10-23 20:28:55,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-10-23 20:28:55,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-23 20:28:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-23 20:28:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-23 20:28:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2020-10-23 20:28:55,454 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 162 [2020-10-23 20:28:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:55,455 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2020-10-23 20:28:55,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-23 20:28:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2020-10-23 20:28:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-10-23 20:28:55,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:55,457 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:55,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:28:55,458 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:55,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1851147437, now seen corresponding path program 16 times [2020-10-23 20:28:55,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:55,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1483094132] [2020-10-23 20:28:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:55,463 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-23 20:28:56,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1483094132] [2020-10-23 20:28:56,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:56,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-10-23 20:28:56,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197787278] [2020-10-23 20:28:56,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-23 20:28:56,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:56,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-23 20:28:56,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-10-23 20:28:56,401 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 22 states. [2020-10-23 20:28:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:57,576 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-10-23 20:28:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-23 20:28:57,576 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-10-23 20:28:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:57,578 INFO L225 Difference]: With dead ends: 121 [2020-10-23 20:28:57,578 INFO L226 Difference]: Without dead ends: 114 [2020-10-23 20:28:57,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 20:28:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-23 20:28:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-23 20:28:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-23 20:28:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2020-10-23 20:28:57,597 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 171 [2020-10-23 20:28:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:57,598 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2020-10-23 20:28:57,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-23 20:28:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2020-10-23 20:28:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-23 20:28:57,600 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:57,600 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:57,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 20:28:57,601 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:57,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:57,601 INFO L82 PathProgramCache]: Analyzing trace with hash -383495636, now seen corresponding path program 17 times [2020-10-23 20:28:57,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:57,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [441289641] [2020-10-23 20:28:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:57,606 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-23 20:28:58,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [441289641] [2020-10-23 20:28:58,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:58,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-10-23 20:28:58,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416751279] [2020-10-23 20:28:58,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-23 20:28:58,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:58,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-23 20:28:58,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:28:58,628 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 23 states. [2020-10-23 20:28:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:59,856 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-10-23 20:28:59,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 20:28:59,857 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-10-23 20:28:59,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:59,858 INFO L225 Difference]: With dead ends: 126 [2020-10-23 20:28:59,858 INFO L226 Difference]: Without dead ends: 119 [2020-10-23 20:28:59,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-10-23 20:28:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-23 20:28:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-23 20:28:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-23 20:28:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2020-10-23 20:28:59,875 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 180 [2020-10-23 20:28:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:59,875 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2020-10-23 20:28:59,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-23 20:28:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2020-10-23 20:28:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-23 20:28:59,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:59,878 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:59,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-23 20:28:59,879 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1621618269, now seen corresponding path program 18 times [2020-10-23 20:28:59,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:59,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [808924185] [2020-10-23 20:28:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:59,884 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:59,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:59,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-23 20:29:01,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [808924185] [2020-10-23 20:29:01,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:01,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-10-23 20:29:01,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608437370] [2020-10-23 20:29:01,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-23 20:29:01,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-23 20:29:01,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-10-23 20:29:01,060 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 24 states. [2020-10-23 20:29:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:02,338 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-10-23 20:29:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-23 20:29:02,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-10-23 20:29:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:02,341 INFO L225 Difference]: With dead ends: 131 [2020-10-23 20:29:02,342 INFO L226 Difference]: Without dead ends: 124 [2020-10-23 20:29:02,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-10-23 20:29:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-23 20:29:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-10-23 20:29:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-23 20:29:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2020-10-23 20:29:02,357 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 189 [2020-10-23 20:29:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:02,358 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2020-10-23 20:29:02,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-23 20:29:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2020-10-23 20:29:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-10-23 20:29:02,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:02,361 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:02,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-23 20:29:02,362 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:02,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1138628534, now seen corresponding path program 19 times [2020-10-23 20:29:02,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:02,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1427037555] [2020-10-23 20:29:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:02,367 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-23 20:29:03,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1427037555] [2020-10-23 20:29:03,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:03,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-10-23 20:29:03,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598927206] [2020-10-23 20:29:03,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-23 20:29:03,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:03,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-23 20:29:03,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:29:03,675 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 25 states. [2020-10-23 20:29:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:05,074 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-10-23 20:29:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-23 20:29:05,074 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-10-23 20:29:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:05,077 INFO L225 Difference]: With dead ends: 136 [2020-10-23 20:29:05,077 INFO L226 Difference]: Without dead ends: 129 [2020-10-23 20:29:05,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-10-23 20:29:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-23 20:29:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-10-23 20:29:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-23 20:29:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2020-10-23 20:29:05,095 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 198 [2020-10-23 20:29:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:05,096 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2020-10-23 20:29:05,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-23 20:29:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2020-10-23 20:29:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-10-23 20:29:05,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:05,098 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:05,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-23 20:29:05,098 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:05,098 INFO L82 PathProgramCache]: Analyzing trace with hash -223075943, now seen corresponding path program 20 times [2020-10-23 20:29:05,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:05,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758220475] [2020-10-23 20:29:05,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:05,104 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 20:29:05,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 20:29:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 20:29:05,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 20:29:05,276 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-23 20:29:05,276 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 20:29:05,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-23 20:29:05,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:29:05 BoogieIcfgContainer [2020-10-23 20:29:05,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:29:05,308 INFO L168 Benchmark]: Toolchain (without parser) took 29532.51 ms. Allocated memory was 125.8 MB in the beginning and 465.6 MB in the end (delta: 339.7 MB). Free memory was 102.5 MB in the beginning and 433.5 MB in the end (delta: -330.9 MB). Peak memory consumption was 273.9 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:05,309 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 125.8 MB. Free memory was 98.4 MB in the beginning and 98.3 MB in the end (delta: 68.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:29:05,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.41 ms. Allocated memory is still 125.8 MB. Free memory was 101.9 MB in the beginning and 92.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:05,310 INFO L168 Benchmark]: Boogie Preprocessor took 30.45 ms. Allocated memory is still 125.8 MB. Free memory was 92.9 MB in the beginning and 91.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:05,311 INFO L168 Benchmark]: RCFGBuilder took 332.91 ms. Allocated memory was 125.8 MB in the beginning and 154.1 MB in the end (delta: 28.3 MB). Free memory was 91.6 MB in the beginning and 132.4 MB in the end (delta: -40.8 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:05,311 INFO L168 Benchmark]: TraceAbstraction took 28903.42 ms. Allocated memory was 154.1 MB in the beginning and 465.6 MB in the end (delta: 311.4 MB). Free memory was 132.1 MB in the beginning and 433.5 MB in the end (delta: -301.3 MB). Peak memory consumption was 274.9 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:05,314 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 125.8 MB. Free memory was 98.4 MB in the beginning and 98.3 MB in the end (delta: 68.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 253.41 ms. Allocated memory is still 125.8 MB. Free memory was 101.9 MB in the beginning and 92.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.45 ms. Allocated memory is still 125.8 MB. Free memory was 92.9 MB in the beginning and 91.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 332.91 ms. Allocated memory was 125.8 MB in the beginning and 154.1 MB in the end (delta: 28.3 MB). Free memory was 91.6 MB in the beginning and 132.4 MB in the end (delta: -40.8 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28903.42 ms. Allocated memory was 154.1 MB in the beginning and 465.6 MB in the end (delta: 311.4 MB). Free memory was 132.1 MB in the beginning and 433.5 MB in the end (delta: -301.3 MB). Peak memory consumption was 274.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int a = 20; [L15] int b = 0; [L16] CALL, EXPR sum(a, b) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND TRUE n <= 0 [L7] return m + n; [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] CALL reach_error() [L3] __assert_fail("0", "sum_20x0-1.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.7s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 543 SDtfs, 2137 SDslu, 1218 SDs, 0 SdLazy, 2367 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 980 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...