/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/fibo_2calls_6-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:40:10,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:40:10,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:40:10,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:40:10,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:40:10,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:40:10,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:40:10,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:40:10,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:40:10,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:40:10,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:40:10,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:40:10,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:40:10,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:40:10,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:40:10,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:40:10,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:40:10,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:40:10,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:40:10,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:40:10,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:40:10,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:40:10,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:40:10,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:40:10,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:40:10,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:40:10,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:40:10,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:40:10,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:40:10,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:40:10,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:40:10,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:40:10,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:40:10,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:40:10,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:40:10,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:40:10,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:40:10,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:40:10,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:40:10,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:40:10,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:40:10,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:40:10,441 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:40:10,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:40:10,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:40:10,447 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:40:10,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:40:10,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:40:10,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:40:10,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:40:10,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:40:10,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:40:10,450 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:40:10,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:40:10,450 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:40:10,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:40:10,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:40:10,451 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:40:10,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:40:10,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:40:10,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:40:10,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:40:10,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:40:10,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:40:10,453 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-11-07 00:40:10,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:40:10,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:40:10,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:40:10,960 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:40:10,960 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:40:10,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-11-07 00:40:11,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d9157e7/f4cba7effdf546b59315351bb947886a/FLAG3364b1b8a [2020-11-07 00:40:11,666 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:40:11,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-11-07 00:40:11,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d9157e7/f4cba7effdf546b59315351bb947886a/FLAG3364b1b8a [2020-11-07 00:40:12,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d9157e7/f4cba7effdf546b59315351bb947886a [2020-11-07 00:40:12,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:40:12,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:40:12,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:40:12,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:40:12,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:40:12,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:12" (1/1) ... [2020-11-07 00:40:12,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1652a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12, skipping insertion in model container [2020-11-07 00:40:12,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:12" (1/1) ... [2020-11-07 00:40:12,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:40:12,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:40:12,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:40:12,288 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:40:12,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:40:12,331 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:40:12,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12 WrapperNode [2020-11-07 00:40:12,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:40:12,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:40:12,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:40:12,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:40:12,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12" (1/1) ... [2020-11-07 00:40:12,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12" (1/1) ... [2020-11-07 00:40:12,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12" (1/1) ... [2020-11-07 00:40:12,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12" (1/1) ... [2020-11-07 00:40:12,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12" (1/1) ... [2020-11-07 00:40:12,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12" (1/1) ... [2020-11-07 00:40:12,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12" (1/1) ... [2020-11-07 00:40:12,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:40:12,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:40:12,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:40:12,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:40:12,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12" (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-11-07 00:40:12,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:40:12,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:40:12,489 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:40:12,489 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 00:40:12,490 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 00:40:12,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:40:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:40:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:40:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:40:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:40:12,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:40:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 00:40:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 00:40:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:40:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:40:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:40:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:40:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:40:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:40:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:40:12,952 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:40:12,952 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:40:12,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:12 BoogieIcfgContainer [2020-11-07 00:40:12,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:40:12,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:40:12,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:40:12,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:40:12,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:40:12" (1/3) ... [2020-11-07 00:40:12,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbabf92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:12, skipping insertion in model container [2020-11-07 00:40:12,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:12" (2/3) ... [2020-11-07 00:40:12,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbabf92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:12, skipping insertion in model container [2020-11-07 00:40:12,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:12" (3/3) ... [2020-11-07 00:40:12,964 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2020-11-07 00:40:12,982 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:40:12,985 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:40:12,999 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:40:13,025 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:40:13,025 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:40:13,025 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:40:13,026 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:40:13,026 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:40:13,026 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:40:13,026 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:40:13,026 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:40:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 00:40:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:40:13,057 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:13,058 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] [2020-11-07 00:40:13,059 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:13,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:13,066 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 00:40:13,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:13,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1928575216] [2020-11-07 00:40:13,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:13,165 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:40:13,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1928575216] [2020-11-07 00:40:13,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:13,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:40:13,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921908685] [2020-11-07 00:40:13,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:40:13,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:40:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:40:13,523 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 00:40:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:14,030 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-11-07 00:40:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:40:14,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:40:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:14,045 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:40:14,046 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 00:40:14,050 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-11-07 00:40:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 00:40:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 00:40:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:40:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:40:14,196 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 00:40:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:14,197 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:40:14,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:40:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:40:14,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:40:14,200 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:14,200 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] [2020-11-07 00:40:14,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:40:14,201 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 00:40:14,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:14,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2134106523] [2020-11-07 00:40:14,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:14,207 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:40:14,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2134106523] [2020-11-07 00:40:14,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:14,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:40:14,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903798045] [2020-11-07 00:40:14,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:40:14,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:14,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:40:14,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:40:14,462 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 00:40:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:14,870 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 00:40:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:40:14,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:40:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:14,874 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:40:14,874 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:40:14,877 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-11-07 00:40:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:40:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:40:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:40:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:40:14,901 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 00:40:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:14,902 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:40:14,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:40:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:40:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:40:14,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:14,905 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:14,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:40:14,906 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:14,907 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 00:40:14,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:14,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [872597099] [2020-11-07 00:40:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:14,912 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:40:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:40:15,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [872597099] [2020-11-07 00:40:15,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:15,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:40:15,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007590725] [2020-11-07 00:40:15,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:40:15,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:15,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:40:15,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:40:15,216 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 00:40:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:15,674 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 00:40:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:15,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:40:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:15,677 INFO L225 Difference]: With dead ends: 92 [2020-11-07 00:40:15,677 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 00:40:15,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:40:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 00:40:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 00:40:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 00:40:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 00:40:15,701 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 00:40:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:15,702 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 00:40:15,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:40:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 00:40:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:40:15,705 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:15,705 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:15,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:40:15,706 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:15,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:15,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 00:40:15,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:15,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042724482] [2020-11-07 00:40:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:15,710 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:40:15,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042724482] [2020-11-07 00:40:15,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:15,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:40:15,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927653843] [2020-11-07 00:40:15,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:40:15,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:40:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:40:15,945 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 00:40:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:16,666 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 00:40:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:16,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 00:40:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:16,670 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:40:16,670 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:40:16,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:40:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:40:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 00:40:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 00:40:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 00:40:16,696 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 00:40:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:16,696 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 00:40:16,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:40:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 00:40:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 00:40:16,709 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:16,709 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:16,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:40:16,710 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 00:40:16,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:16,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [560548439] [2020-11-07 00:40:16,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:16,714 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:16,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:16,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:16,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:16,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:16,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:40:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:16,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 00:40:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:40:16,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [560548439] [2020-11-07 00:40:16,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:16,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:40:16,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039788861] [2020-11-07 00:40:16,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:40:16,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:16,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:40:16,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:40:16,874 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 00:40:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:17,291 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 00:40:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:17,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 00:40:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:17,297 INFO L225 Difference]: With dead ends: 140 [2020-11-07 00:40:17,299 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:40:17,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:40:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:40:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:40:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:40:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 00:40:17,342 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 00:40:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:17,342 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 00:40:17,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:40:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 00:40:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:40:17,345 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:17,346 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:17,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:40:17,346 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:17,347 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 00:40:17,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:17,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15027879] [2020-11-07 00:40:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:17,356 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:17,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:17,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:17,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:17,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:17,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:17,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:40:17,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15027879] [2020-11-07 00:40:17,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:17,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:40:17,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792258919] [2020-11-07 00:40:17,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:40:17,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:17,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:40:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:40:17,661 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 00:40:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:18,243 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 00:40:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:40:18,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:40:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:18,247 INFO L225 Difference]: With dead ends: 152 [2020-11-07 00:40:18,247 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 00:40:18,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:40:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 00:40:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 00:40:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 00:40:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 00:40:18,283 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 00:40:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:18,284 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 00:40:18,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:40:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 00:40:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:40:18,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:18,287 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:18,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:40:18,287 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 00:40:18,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:18,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [822373374] [2020-11-07 00:40:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:18,292 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:40:18,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [822373374] [2020-11-07 00:40:18,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:18,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:40:18,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794058340] [2020-11-07 00:40:18,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:40:18,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:18,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:40:18,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:18,475 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 00:40:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:19,316 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 00:40:19,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:40:19,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 00:40:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:19,325 INFO L225 Difference]: With dead ends: 128 [2020-11-07 00:40:19,325 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 00:40:19,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 00:40:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 00:40:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 00:40:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 00:40:19,380 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 00:40:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:19,383 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 00:40:19,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:40:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 00:40:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 00:40:19,387 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:19,388 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:19,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:40:19,388 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 00:40:19,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:19,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2004373492] [2020-11-07 00:40:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:19,397 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 00:40:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:40:19,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2004373492] [2020-11-07 00:40:19,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:19,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:40:19,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716956136] [2020-11-07 00:40:19,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:40:19,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:19,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:40:19,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:19,732 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 00:40:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:20,444 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 00:40:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:20,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 00:40:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:20,450 INFO L225 Difference]: With dead ends: 237 [2020-11-07 00:40:20,450 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 00:40:20,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:40:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 00:40:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 00:40:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:40:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 00:40:20,538 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 00:40:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:20,539 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 00:40:20,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:40:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 00:40:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 00:40:20,544 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:20,544 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:20,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:40:20,545 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 00:40:20,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:20,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [84456320] [2020-11-07 00:40:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:20,555 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:40:20,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [84456320] [2020-11-07 00:40:20,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:20,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:20,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508816983] [2020-11-07 00:40:20,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:20,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:20,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:20,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:20,819 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-11-07 00:40:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:21,644 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 00:40:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:21,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-07 00:40:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:21,653 INFO L225 Difference]: With dead ends: 267 [2020-11-07 00:40:21,654 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 00:40:21,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 00:40:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 00:40:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 00:40:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 00:40:21,714 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 00:40:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:21,715 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 00:40:21,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 00:40:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 00:40:21,718 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:21,718 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:21,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:40:21,719 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-11-07 00:40:21,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:21,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1843847438] [2020-11-07 00:40:21,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:21,723 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-07 00:40:21,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1843847438] [2020-11-07 00:40:21,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:21,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:21,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841190369] [2020-11-07 00:40:21,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:21,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:21,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:21,940 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-11-07 00:40:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:22,763 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-11-07 00:40:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:40:22,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2020-11-07 00:40:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:22,769 INFO L225 Difference]: With dead ends: 223 [2020-11-07 00:40:22,769 INFO L226 Difference]: Without dead ends: 216 [2020-11-07 00:40:22,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:40:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-07 00:40:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-11-07 00:40:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-07 00:40:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-11-07 00:40:22,821 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 96 [2020-11-07 00:40:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:22,822 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-11-07 00:40:22,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-11-07 00:40:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 00:40:22,826 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:22,826 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:22,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:40:22,827 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash -375801608, now seen corresponding path program 2 times [2020-11-07 00:40:22,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:22,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [288939714] [2020-11-07 00:40:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:22,831 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 00:40:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 00:40:23,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [288939714] [2020-11-07 00:40:23,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:23,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:23,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863310892] [2020-11-07 00:40:23,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:23,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:23,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:23,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:23,116 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 10 states. [2020-11-07 00:40:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:23,977 INFO L93 Difference]: Finished difference Result 455 states and 768 transitions. [2020-11-07 00:40:23,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:23,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2020-11-07 00:40:23,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:23,983 INFO L225 Difference]: With dead ends: 455 [2020-11-07 00:40:23,984 INFO L226 Difference]: Without dead ends: 262 [2020-11-07 00:40:23,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-07 00:40:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2020-11-07 00:40:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-11-07 00:40:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2020-11-07 00:40:24,052 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 132 [2020-11-07 00:40:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:24,053 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2020-11-07 00:40:24,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2020-11-07 00:40:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-11-07 00:40:24,059 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:24,059 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-11-07 00:40:24,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:40:24,059 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash 974308804, now seen corresponding path program 2 times [2020-11-07 00:40:24,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:24,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070599626] [2020-11-07 00:40:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:24,064 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 00:40:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 12 proven. 61 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-11-07 00:40:24,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070599626] [2020-11-07 00:40:24,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:24,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:40:24,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470948723] [2020-11-07 00:40:24,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:40:24,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:24,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:40:24,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:40:24,605 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 15 states. [2020-11-07 00:40:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:26,938 INFO L93 Difference]: Finished difference Result 441 states and 753 transitions. [2020-11-07 00:40:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 00:40:26,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2020-11-07 00:40:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:26,942 INFO L225 Difference]: With dead ends: 441 [2020-11-07 00:40:26,942 INFO L226 Difference]: Without dead ends: 171 [2020-11-07 00:40:26,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 00:40:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-11-07 00:40:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2020-11-07 00:40:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 00:40:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2020-11-07 00:40:26,982 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 186 [2020-11-07 00:40:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:26,982 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2020-11-07 00:40:26,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:40:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2020-11-07 00:40:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-07 00:40:26,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:26,986 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2020-11-07 00:40:26,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:40:26,987 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:26,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash -280620749, now seen corresponding path program 2 times [2020-11-07 00:40:26,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:26,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272378587] [2020-11-07 00:40:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:26,992 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 00:40:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-11-07 00:40:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 42 proven. 63 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2020-11-07 00:40:27,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272378587] [2020-11-07 00:40:27,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:27,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:40:27,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615508543] [2020-11-07 00:40:27,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:40:27,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:27,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:40:27,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:40:27,614 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand 15 states. [2020-11-07 00:40:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:29,599 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2020-11-07 00:40:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:40:29,600 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 239 [2020-11-07 00:40:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:29,603 INFO L225 Difference]: With dead ends: 265 [2020-11-07 00:40:29,603 INFO L226 Difference]: Without dead ends: 144 [2020-11-07 00:40:29,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:40:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-07 00:40:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2020-11-07 00:40:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-11-07 00:40:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2020-11-07 00:40:29,634 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 239 [2020-11-07 00:40:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:29,635 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2020-11-07 00:40:29,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:40:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2020-11-07 00:40:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2020-11-07 00:40:29,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:29,640 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 15, 14, 14, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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] [2020-11-07 00:40:29,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:40:29,640 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:29,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:29,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1776030340, now seen corresponding path program 3 times [2020-11-07 00:40:29,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:29,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2060281858] [2020-11-07 00:40:29,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:29,646 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 00:40:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-11-07 00:40:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 00:40:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 10 proven. 81 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2020-11-07 00:40:30,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2060281858] [2020-11-07 00:40:30,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:30,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:40:30,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173755932] [2020-11-07 00:40:30,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:40:30,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:40:30,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:30,435 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 17 states. [2020-11-07 00:40:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:33,102 INFO L93 Difference]: Finished difference Result 319 states and 438 transitions. [2020-11-07 00:40:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 00:40:33,103 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 292 [2020-11-07 00:40:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:33,107 INFO L225 Difference]: With dead ends: 319 [2020-11-07 00:40:33,107 INFO L226 Difference]: Without dead ends: 190 [2020-11-07 00:40:33,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 00:40:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-11-07 00:40:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 168. [2020-11-07 00:40:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-07 00:40:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2020-11-07 00:40:33,148 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 292 [2020-11-07 00:40:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:33,148 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2020-11-07 00:40:33,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:40:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2020-11-07 00:40:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-07 00:40:33,152 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:33,153 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:33,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:40:33,153 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:33,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:33,154 INFO L82 PathProgramCache]: Analyzing trace with hash -914043270, now seen corresponding path program 4 times [2020-11-07 00:40:33,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:33,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1933685866] [2020-11-07 00:40:33,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:33,157 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:40:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2020-11-07 00:40:34,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1933685866] [2020-11-07 00:40:34,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:34,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-11-07 00:40:34,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363372251] [2020-11-07 00:40:34,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-07 00:40:34,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:34,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-07 00:40:34,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:40:34,704 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand 29 states. [2020-11-07 00:40:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:39,572 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2020-11-07 00:40:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-07 00:40:39,572 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 237 [2020-11-07 00:40:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:39,575 INFO L225 Difference]: With dead ends: 181 [2020-11-07 00:40:39,575 INFO L226 Difference]: Without dead ends: 174 [2020-11-07 00:40:39,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=318, Invalid=4794, Unknown=0, NotChecked=0, Total=5112 [2020-11-07 00:40:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-07 00:40:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2020-11-07 00:40:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-07 00:40:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2020-11-07 00:40:39,622 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 237 [2020-11-07 00:40:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:39,623 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2020-11-07 00:40:39,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-07 00:40:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2020-11-07 00:40:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2020-11-07 00:40:39,626 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:39,627 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 16, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 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] [2020-11-07 00:40:39,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:40:39,627 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:39,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:39,628 INFO L82 PathProgramCache]: Analyzing trace with hash -660168264, now seen corresponding path program 5 times [2020-11-07 00:40:39,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:39,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [382339036] [2020-11-07 00:40:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:39,632 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 00:40:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-11-07 00:40:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 5 proven. 97 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2020-11-07 00:40:40,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [382339036] [2020-11-07 00:40:40,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:40,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:40:40,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786375528] [2020-11-07 00:40:40,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:40:40,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:40,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:40:40,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:40:40,610 INFO L87 Difference]: Start difference. First operand 168 states and 207 transitions. Second operand 12 states. [2020-11-07 00:40:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:41,688 INFO L93 Difference]: Finished difference Result 318 states and 406 transitions. [2020-11-07 00:40:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:40:41,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 344 [2020-11-07 00:40:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:41,694 INFO L225 Difference]: With dead ends: 318 [2020-11-07 00:40:41,694 INFO L226 Difference]: Without dead ends: 167 [2020-11-07 00:40:41,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:40:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-11-07 00:40:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2020-11-07 00:40:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 00:40:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 200 transitions. [2020-11-07 00:40:41,744 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 200 transitions. Word has length 344 [2020-11-07 00:40:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:41,744 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 200 transitions. [2020-11-07 00:40:41,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:40:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 200 transitions. [2020-11-07 00:40:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2020-11-07 00:40:41,748 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:41,748 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2020-11-07 00:40:41,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:40:41,749 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash 569490289, now seen corresponding path program 6 times [2020-11-07 00:40:41,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:41,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051158103] [2020-11-07 00:40:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:41,756 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:40:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 00:40:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2020-11-07 00:40:42,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051158103] [2020-11-07 00:40:42,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:42,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:40:42,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37645712] [2020-11-07 00:40:42,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:40:42,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:40:42,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:40:42,685 INFO L87 Difference]: Start difference. First operand 164 states and 200 transitions. Second operand 15 states. [2020-11-07 00:40:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:44,518 INFO L93 Difference]: Finished difference Result 323 states and 410 transitions. [2020-11-07 00:40:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:40:44,518 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 290 [2020-11-07 00:40:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:44,522 INFO L225 Difference]: With dead ends: 323 [2020-11-07 00:40:44,522 INFO L226 Difference]: Without dead ends: 177 [2020-11-07 00:40:44,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 00:40:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-11-07 00:40:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2020-11-07 00:40:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-11-07 00:40:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 208 transitions. [2020-11-07 00:40:44,564 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 208 transitions. Word has length 290 [2020-11-07 00:40:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:44,564 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 208 transitions. [2020-11-07 00:40:44,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:40:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 208 transitions. [2020-11-07 00:40:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2020-11-07 00:40:44,569 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:44,569 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 21, 20, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 8, 8, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:44,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:40:44,570 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:44,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash 242910628, now seen corresponding path program 7 times [2020-11-07 00:40:44,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:44,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [85893380] [2020-11-07 00:40:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:44,576 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:44,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:44,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:44,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:44,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:44,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:40:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:40:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:40:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 1 proven. 104 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2020-11-07 00:40:45,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [85893380] [2020-11-07 00:40:45,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:45,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:40:45,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202085408] [2020-11-07 00:40:45,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:40:45,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:45,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:40:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:40:45,800 INFO L87 Difference]: Start difference. First operand 171 states and 208 transitions. Second operand 13 states. [2020-11-07 00:40:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:47,085 INFO L93 Difference]: Finished difference Result 198 states and 245 transitions. [2020-11-07 00:40:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:40:47,086 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 466 [2020-11-07 00:40:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:47,088 INFO L225 Difference]: With dead ends: 198 [2020-11-07 00:40:47,089 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:40:47,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2020-11-07 00:40:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:40:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:40:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:40:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:40:47,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 466 [2020-11-07 00:40:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:47,092 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:40:47,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:40:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:40:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:40:47,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 00:40:47,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:41:01,216 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 8 [2020-11-07 00:41:01,415 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 6 [2020-11-07 00:41:01,710 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 6 [2020-11-07 00:41:02,334 WARN L194 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 31 [2020-11-07 00:41:02,561 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 6 [2020-11-07 00:41:03,738 WARN L194 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 152 DAG size of output: 49 [2020-11-07 00:41:04,840 WARN L194 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 144 DAG size of output: 39 [2020-11-07 00:41:05,511 WARN L194 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 31 [2020-11-07 00:41:06,565 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 142 DAG size of output: 43 [2020-11-07 00:41:07,647 WARN L194 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 142 DAG size of output: 43 [2020-11-07 00:41:07,793 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 6 [2020-11-07 00:41:08,419 WARN L194 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 20 [2020-11-07 00:41:09,074 WARN L194 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 27 [2020-11-07 00:41:09,915 WARN L194 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 35 [2020-11-07 00:41:10,611 WARN L194 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 27 [2020-11-07 00:41:10,831 WARN L194 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 6 [2020-11-07 00:41:12,446 WARN L194 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 182 DAG size of output: 39 [2020-11-07 00:41:12,661 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 7 [2020-11-07 00:41:13,229 WARN L194 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 20 [2020-11-07 00:41:14,153 WARN L194 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 35 [2020-11-07 00:41:14,826 WARN L194 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 37 [2020-11-07 00:41:15,419 WARN L194 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 31 [2020-11-07 00:41:15,609 WARN L194 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 8 [2020-11-07 00:41:17,213 WARN L194 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 182 DAG size of output: 39 [2020-11-07 00:41:17,455 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 3 [2020-11-07 00:41:17,463 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,464 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,464 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,464 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,464 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,464 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,464 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:17,464 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:17,464 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,465 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:41:17,465 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,465 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,465 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:41:17,465 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:17,465 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:17,465 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:17,465 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:41:17,465 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:41:17,466 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-11-07 00:41:17,466 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (<= 6 main_~x~0) [2020-11-07 00:41:17,466 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (<= 6 main_~x~0) [2020-11-07 00:41:17,466 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-11-07 00:41:17,466 INFO L262 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-11-07 00:41:17,466 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-11-07 00:41:17,466 INFO L262 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6)) [2020-11-07 00:41:17,466 INFO L262 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 8 |main_#t~ret11|) (<= 6 main_~x~0) (<= |main_#t~ret11| 8) (<= main_~x~0 6)) [2020-11-07 00:41:17,467 INFO L262 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 6 main_~x~0) [2020-11-07 00:41:17,467 INFO L262 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= 8 |main_#t~ret11|) (<= 6 main_~x~0) (<= |main_#t~ret11| 8) (<= main_~x~0 6)) [2020-11-07 00:41:17,467 INFO L262 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= 8 |main_#t~ret11|) (<= 6 main_~x~0) (<= |main_#t~ret11| 8) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-11-07 00:41:17,467 INFO L269 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-11-07 00:41:17,467 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 2))) [2020-11-07 00:41:17,467 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= 5 |fibo2_#in~n|)) (and (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n) (<= |fibo2_#t~ret9| 1) .cse0 (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 00:41:17,467 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1) (< 0 fibo2_~n)) [2020-11-07 00:41:17,468 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= 5 |fibo2_#in~n|)) (and (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n) (<= |fibo2_#t~ret9| 1) .cse0 (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 00:41:17,468 INFO L262 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-11-07 00:41:17,468 INFO L262 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (or (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= .cse1 5) (<= 5 |fibo2_#in~n|) (<= 5 .cse1)) (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 3) (<= 2 .cse1) (<= 3 fibo2_~n) (<= |fibo2_#t~ret9| 1) .cse0 (<= .cse1 2) (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 00:41:17,468 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-11-07 00:41:17,469 INFO L262 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (or (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= .cse1 5) (<= 5 |fibo2_#in~n|) (<= 5 .cse1)) (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 3) (<= 2 .cse1) (<= 3 fibo2_~n) (<= |fibo2_#t~ret9| 1) .cse0 (<= .cse1 2) (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 00:41:17,469 INFO L262 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-11-07 00:41:17,469 INFO L262 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n) .cse0) (and (<= |fibo2_#t~ret9| 3) (<= |fibo2_#res| 5) (<= 3 |fibo2_#t~ret9|) .cse0 (<= .cse1 5) (<= 5 |fibo2_#res|) (<= 5 .cse1)))) (or (not (<= |fibo2_#in~n| 4)) (and (<= 2 .cse1) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= |fibo2_#t~ret9| 1) (<= .cse1 2) (<= 1 |fibo2_#t~ret9|))))) [2020-11-07 00:41:17,469 INFO L262 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n) .cse0) (and (<= |fibo2_#t~ret9| 3) (<= |fibo2_#res| 5) (<= 3 |fibo2_#t~ret9|) .cse0 (<= 5 |fibo2_#res|)))) (or (not (<= |fibo2_#in~n| 4)) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= |fibo2_#t~ret9| 1) (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 00:41:17,469 INFO L262 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= 6 fibo2_~n) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)) (and (<= |fibo2_#res| 5) (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 1))) (or (and .cse0 (< 0 fibo2_~n)) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))))) [2020-11-07 00:41:17,470 INFO L262 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= 6 fibo2_~n) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)) (and (<= |fibo2_#res| 5) (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 1))) (or (and .cse0 (< 0 fibo2_~n)) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))))) [2020-11-07 00:41:17,470 INFO L269 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-11-07 00:41:17,470 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:41:17,470 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (let ((.cse2 (<= 5 |fibo1_#in~n|)) (.cse1 (<= fibo1_~n 5)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|) .cse0) (and .cse1 .cse0 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and .cse2 (<= 5 |fibo1_#t~ret7|) .cse0 (<= |fibo1_#t~ret7| 5)) (and .cse2 .cse1 .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) (or (not (<= |fibo1_#in~n| 3)) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1)))) [2020-11-07 00:41:17,470 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:41:17,471 INFO L262 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (let ((.cse2 (<= 5 |fibo1_#in~n|)) (.cse1 (<= fibo1_~n 5)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|) .cse0) (and .cse1 .cse0 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and .cse2 (<= 5 |fibo1_#t~ret7|) .cse0 (<= |fibo1_#t~ret7| 5)) (and .cse2 .cse1 .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) (or (not (<= |fibo1_#in~n| 3)) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1)))) [2020-11-07 00:41:17,471 INFO L262 CegarLoopResult]: At program point L12(lines 12 16) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-11-07 00:41:17,471 INFO L262 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|)) (.cse4 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (let ((.cse0 (and (or (and (<= fibo1_~n 5) .cse1) (and (<= 5 |fibo1_#t~ret7|) .cse1 (<= 8 .cse4) (<= |fibo1_#t~ret7| 5) (<= .cse4 8))) (<= 5 fibo1_~n))) (.cse2 (and (<= 7 |fibo1_#in~n|) .cse1)) (.cse3 (and (<= .cse4 3) (<= 3 .cse4) (<= 4 |fibo1_#in~n|) .cse1 (<= |fibo1_#t~ret7| 2) (<= |fibo1_#in~n| 4) (<= 2 |fibo1_#t~ret7|)))) (and (or .cse0 (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|) .cse1) .cse2 .cse3) (or (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse4) (<= |fibo1_#t~ret7| 1) (<= .cse4 1)) .cse0 .cse2 .cse3)))) [2020-11-07 00:41:17,471 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:41:17,471 INFO L262 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|)) (.cse4 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (let ((.cse0 (and (or (and (<= fibo1_~n 5) .cse1) (and (<= 5 |fibo1_#t~ret7|) .cse1 (<= 8 .cse4) (<= |fibo1_#t~ret7| 5) (<= .cse4 8))) (<= 5 fibo1_~n))) (.cse2 (and (<= 7 |fibo1_#in~n|) .cse1)) (.cse3 (and (<= .cse4 3) (<= 3 .cse4) (<= 4 |fibo1_#in~n|) .cse1 (<= |fibo1_#t~ret7| 2) (<= |fibo1_#in~n| 4) (<= 2 |fibo1_#t~ret7|)))) (and (or .cse0 (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|) .cse1) .cse2 .cse3) (or (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse4) (<= |fibo1_#t~ret7| 1) (<= .cse4 1)) .cse0 .cse2 .cse3)))) [2020-11-07 00:41:17,472 INFO L262 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (and (or (and (or (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8)) (<= fibo1_~n 5)) (<= 5 fibo1_~n)) (not (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) (<= |fibo1_#in~n| 4)) (<= 7 |fibo1_#in~n|)) (or (<= |fibo1_#in~n| 0) (not (<= |fibo1_#in~n| 3)) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))) (= fibo1_~n |fibo1_#in~n|) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 00:41:17,472 INFO L262 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-11-07 00:41:17,472 INFO L262 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) (<= .cse0 3) (<= 3 .cse0) (<= |fibo1_#t~ret7| 2) (<= |fibo1_#in~n| 4) (<= 2 |fibo1_#t~ret7|)) (<= 7 |fibo1_#in~n|) (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|)) (and (or (<= fibo1_~n 5) (and (<= 8 |fibo1_#res|) (<= 5 |fibo1_#t~ret7|) (<= |fibo1_#res| 8) (<= 8 .cse0) (<= |fibo1_#t~ret7| 5) (<= .cse0 8))) (<= 5 fibo1_~n))) (or (not (<= |fibo1_#in~n| 3)) (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse0) (<= |fibo1_#t~ret7| 1) (<= |fibo1_#res| 1) (<= .cse0 1) (<= 1 |fibo1_#res|))) (= fibo1_~n |fibo1_#in~n|))) [2020-11-07 00:41:17,472 INFO L262 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (and (or (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#in~n| 2) (<= |fibo1_#t~ret7| 1) (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (<= 7 |fibo1_#in~n|) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) (<= 4 |fibo1_#in~n|) (<= |fibo1_#t~ret7| 2) (<= |fibo1_#in~n| 4) (<= 2 |fibo1_#t~ret7|)) (and (<= 5 fibo1_~n) (or (and (<= 8 |fibo1_#res|) (<= 5 |fibo1_#t~ret7|) (<= |fibo1_#res| 8) (<= |fibo1_#t~ret7| 5)) (<= fibo1_~n 5)))) (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:41:17,473 INFO L262 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (and (or (and (or (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8)) (<= fibo1_~n 5)) (<= 5 fibo1_~n)) (not (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) (<= |fibo1_#in~n| 4)) (<= 7 |fibo1_#in~n|)) (or (<= |fibo1_#in~n| 0) (not (<= |fibo1_#in~n| 3)) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))) (= fibo1_~n |fibo1_#in~n|) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 00:41:17,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:41:17 BoogieIcfgContainer [2020-11-07 00:41:17,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:41:17,504 INFO L168 Benchmark]: Toolchain (without parser) took 65454.26 ms. Allocated memory was 159.4 MB in the beginning and 480.2 MB in the end (delta: 320.9 MB). Free memory was 137.0 MB in the beginning and 249.1 MB in the end (delta: -112.1 MB). Peak memory consumption was 290.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:17,504 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory was 101.8 MB in the beginning and 101.7 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:41:17,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.67 ms. Allocated memory is still 159.4 MB. Free memory was 136.5 MB in the beginning and 126.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:17,505 INFO L168 Benchmark]: Boogie Preprocessor took 43.50 ms. Allocated memory is still 159.4 MB. Free memory was 126.5 MB in the beginning and 125.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:17,506 INFO L168 Benchmark]: RCFGBuilder took 576.48 ms. Allocated memory is still 159.4 MB. Free memory was 125.2 MB in the beginning and 142.8 MB in the end (delta: -17.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:17,507 INFO L168 Benchmark]: TraceAbstraction took 64544.86 ms. Allocated memory was 159.4 MB in the beginning and 480.2 MB in the end (delta: 320.9 MB). Free memory was 142.4 MB in the beginning and 249.1 MB in the end (delta: -106.7 MB). Peak memory consumption was 295.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:17,509 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.22 ms. Allocated memory is still 125.8 MB. Free memory was 101.8 MB in the beginning and 101.7 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 275.67 ms. Allocated memory is still 159.4 MB. Free memory was 136.5 MB in the beginning and 126.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.50 ms. Allocated memory is still 159.4 MB. Free memory was 126.5 MB in the beginning and 125.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 576.48 ms. Allocated memory is still 159.4 MB. Free memory was 125.2 MB in the beginning and 142.8 MB in the end (delta: -17.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 64544.86 ms. Allocated memory was 159.4 MB in the beginning and 480.2 MB in the end (delta: 320.9 MB). Free memory was 142.4 MB in the beginning and 249.1 MB in the end (delta: -106.7 MB). Peak memory consumption was 295.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 37]: Procedure Contract for main Derived contract for procedure main: 6 <= x - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((((6 <= n && n == \old(n)) || (n == \old(n) && \old(n) <= 0)) || ((\result <= 5 && 5 <= \old(n)) && 5 <= \result)) || (((\old(n) <= 3 && \result <= 2) && 3 <= n) && 2 <= \result)) || ((1 <= \result && \result <= 1) && \old(n) <= 1)) && ((n == \old(n) && 0 < n) || (\result <= 0 && 0 <= \result)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((((((((8 <= \result && \result <= 8) || n <= 5) && 5 <= n) || !(3 <= \old(n))) || ((\result <= 3 && 3 <= \result) && \old(n) <= 4)) || 7 <= \old(n)) && ((\old(n) <= 0 || !(\old(n) <= 3)) || (\result <= 1 && 1 <= \result))) && n == \old(n)) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 34.0s, OverallIterations: 18, TraceHistogramMax: 26, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 30.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1031 SDtfs, 1642 SDslu, 2610 SDs, 0 SdLazy, 9479 SolverSat, 812 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2361 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 3289 PreInvPairs, 7120 NumberOfFragments, 1385 HoareAnnotationTreeSize, 3289 FomulaSimplifications, 1214589 FormulaSimplificationTreeSizeReduction, 13.8s HoareSimplificationTime, 57 FomulaSimplificationsInter, 135391 FormulaSimplificationTreeSizeReductionInter, 16.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...