/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_7-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:41:04,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:41:04,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:41:04,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:41:04,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:41:04,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:41:04,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:41:04,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:41:04,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:41:04,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:41:04,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:41:04,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:41:04,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:41:04,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:41:04,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:41:04,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:41:04,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:41:04,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:41:04,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:41:04,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:41:04,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:41:04,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:41:04,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:41:04,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:41:04,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:41:04,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:41:04,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:41:04,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:41:04,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:41:04,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:41:04,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:41:04,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:41:04,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:41:04,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:41:04,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:41:04,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:41:04,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:41:04,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:41:04,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:41:04,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:41:04,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:41:04,471 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:41:04,501 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:41:04,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:41:04,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:41:04,508 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:41:04,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:41:04,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:41:04,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:41:04,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:41:04,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:41:04,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:41:04,511 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:41:04,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:41:04,512 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:41:04,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:41:04,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:41:04,512 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:41:04,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:41:04,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:41:04,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:04,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:41:04,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:41:04,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:41:04,514 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:41:05,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:41:05,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:41:05,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:41:05,095 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:41:05,096 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:41:05,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-1.c [2020-11-07 00:41:05,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff990de1/c53773dcbc634fbfb8471737060fd7c0/FLAGc1263b4d9 [2020-11-07 00:41:05,796 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:41:05,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-1.c [2020-11-07 00:41:05,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff990de1/c53773dcbc634fbfb8471737060fd7c0/FLAGc1263b4d9 [2020-11-07 00:41:06,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff990de1/c53773dcbc634fbfb8471737060fd7c0 [2020-11-07 00:41:06,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:41:06,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:41:06,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:06,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:41:06,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:41:06,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:06" (1/1) ... [2020-11-07 00:41:06,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128aee89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06, skipping insertion in model container [2020-11-07 00:41:06,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:06" (1/1) ... [2020-11-07 00:41:06,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:41:06,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:41:06,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:06,399 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:41:06,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:06,437 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:41:06,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06 WrapperNode [2020-11-07 00:41:06,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:06,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:41:06,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:41:06,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:41:06,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06" (1/1) ... [2020-11-07 00:41:06,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06" (1/1) ... [2020-11-07 00:41:06,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06" (1/1) ... [2020-11-07 00:41:06,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06" (1/1) ... [2020-11-07 00:41:06,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06" (1/1) ... [2020-11-07 00:41:06,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06" (1/1) ... [2020-11-07 00:41:06,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06" (1/1) ... [2020-11-07 00:41:06,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:41:06,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:41:06,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:41:06,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:41:06,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06" (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:41:06,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:41:06,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:41:06,585 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:41:06,585 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-07 00:41:06,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:41:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:41:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:41:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:41:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:41:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:41:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-07 00:41:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:41:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:41:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:41:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:41:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:41:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:41:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:41:06,893 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:41:06,893 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:41:06,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:06 BoogieIcfgContainer [2020-11-07 00:41:06,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:41:06,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:41:06,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:41:06,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:41:06,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:06" (1/3) ... [2020-11-07 00:41:06,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d416699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:06, skipping insertion in model container [2020-11-07 00:41:06,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:06" (2/3) ... [2020-11-07 00:41:06,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d416699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:06, skipping insertion in model container [2020-11-07 00:41:06,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:06" (3/3) ... [2020-11-07 00:41:06,911 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-1.c [2020-11-07 00:41:06,935 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:41:06,940 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:41:06,958 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:41:06,989 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:41:06,989 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:41:06,990 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:41:06,990 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:41:06,990 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:41:06,990 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:41:06,990 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:41:06,990 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:41:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-07 00:41:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:41:07,020 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:07,021 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:41:07,022 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:07,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-11-07 00:41:07,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:07,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [487375663] [2020-11-07 00:41:07,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:07,175 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:07,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:07,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:07,557 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:41:07,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [487375663] [2020-11-07 00:41:07,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:07,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:07,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465060556] [2020-11-07 00:41:07,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:07,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:07,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:07,592 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-11-07 00:41:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:08,035 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-11-07 00:41:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:41:08,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:41:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:08,058 INFO L225 Difference]: With dead ends: 57 [2020-11-07 00:41:08,058 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 00:41:08,071 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:41:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 00:41:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 00:41:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:41:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 00:41:08,168 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-11-07 00:41:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:08,170 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 00:41:08,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 00:41:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:41:08,175 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:08,176 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:41:08,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:41:08,177 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-11-07 00:41:08,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:08,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057144405] [2020-11-07 00:41:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:08,195 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:08,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:08,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:08,387 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:41:08,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1057144405] [2020-11-07 00:41:08,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:08,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:08,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395807138] [2020-11-07 00:41:08,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:08,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:08,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:08,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:08,393 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-11-07 00:41:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:08,666 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-11-07 00:41:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:41:08,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:41:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:08,669 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:41:08,669 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:41:08,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:41:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-11-07 00:41:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:41:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 00:41:08,688 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-11-07 00:41:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:08,688 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 00:41:08,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 00:41:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:41:08,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:08,691 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:08,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:41:08,692 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-11-07 00:41:08,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:08,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1132899683] [2020-11-07 00:41:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:08,697 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:08,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:08,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:08,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:08,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:41:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 00:41:08,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1132899683] [2020-11-07 00:41:08,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:08,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:41:08,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221816736] [2020-11-07 00:41:08,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:41:08,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:41:08,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:41:08,924 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-11-07 00:41:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:09,229 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-07 00:41:09,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:09,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:41:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:09,232 INFO L225 Difference]: With dead ends: 62 [2020-11-07 00:41:09,232 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:41:09,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:41:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:41:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:41:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:41:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 00:41:09,251 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-11-07 00:41:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:09,251 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 00:41:09,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:41:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 00:41:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:09,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:09,254 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:09,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:41:09,255 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:09,255 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-11-07 00:41:09,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:09,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [621516839] [2020-11-07 00:41:09,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:09,259 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:09,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:09,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:09,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:09,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:09,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [621516839] [2020-11-07 00:41:09,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:09,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:41:09,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169727785] [2020-11-07 00:41:09,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:41:09,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:41:09,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:41:09,418 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 00:41:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:09,840 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-11-07 00:41:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:41:09,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-11-07 00:41:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:09,844 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:41:09,844 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:41:09,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:41:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:41:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:41:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-11-07 00:41:09,869 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-11-07 00:41:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:09,870 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-11-07 00:41:09,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:41:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-11-07 00:41:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:41:09,873 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:09,873 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:09,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:41:09,874 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:09,875 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-11-07 00:41:09,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:09,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845074523] [2020-11-07 00:41:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:09,878 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:09,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:09,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:09,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:41:10,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [845074523] [2020-11-07 00:41:10,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:10,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:41:10,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713301201] [2020-11-07 00:41:10,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:41:10,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:10,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:41:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:41:10,074 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-11-07 00:41:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:10,550 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-11-07 00:41:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:41:10,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:41:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:10,561 INFO L225 Difference]: With dead ends: 118 [2020-11-07 00:41:10,562 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 00:41:10,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:41:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 00:41:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 00:41:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 00:41:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-11-07 00:41:10,611 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-11-07 00:41:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:10,612 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-11-07 00:41:10,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:41:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-11-07 00:41:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:41:10,624 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:10,624 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:10,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:41:10,625 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-11-07 00:41:10,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:10,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [586528415] [2020-11-07 00:41:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:10,633 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-07 00:41:10,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [586528415] [2020-11-07 00:41:10,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:10,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:41:10,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555317996] [2020-11-07 00:41:10,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:41:10,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:41:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:41:10,857 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-11-07 00:41:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:11,351 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-11-07 00:41:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:41:11,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-11-07 00:41:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:11,355 INFO L225 Difference]: With dead ends: 96 [2020-11-07 00:41:11,355 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:41:11,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:41:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:41:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-11-07 00:41:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 00:41:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-11-07 00:41:11,386 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-11-07 00:41:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:11,386 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-11-07 00:41:11,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:41:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-11-07 00:41:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 00:41:11,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:11,389 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:11,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:41:11,390 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:11,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-11-07 00:41:11,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:11,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [11709254] [2020-11-07 00:41:11,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:11,395 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-07 00:41:11,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [11709254] [2020-11-07 00:41:11,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:11,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:11,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632392304] [2020-11-07 00:41:11,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:11,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:11,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:11,720 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-11-07 00:41:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:12,361 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-11-07 00:41:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:12,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-11-07 00:41:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:12,367 INFO L225 Difference]: With dead ends: 146 [2020-11-07 00:41:12,368 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 00:41:12,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 00:41:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-11-07 00:41:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 00:41:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-11-07 00:41:12,431 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-11-07 00:41:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:12,432 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-11-07 00:41:12,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-11-07 00:41:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 00:41:12,444 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:12,445 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:12,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:41:12,445 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:12,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-11-07 00:41:12,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:12,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1342616020] [2020-11-07 00:41:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:12,453 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2020-11-07 00:41:12,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1342616020] [2020-11-07 00:41:12,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:12,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:41:12,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981224180] [2020-11-07 00:41:12,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:41:12,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:12,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:41:12,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:12,969 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 10 states. [2020-11-07 00:41:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:13,787 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2020-11-07 00:41:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:41:13,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2020-11-07 00:41:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:13,793 INFO L225 Difference]: With dead ends: 240 [2020-11-07 00:41:13,793 INFO L226 Difference]: Without dead ends: 233 [2020-11-07 00:41:13,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:41:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-11-07 00:41:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 215. [2020-11-07 00:41:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-07 00:41:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2020-11-07 00:41:13,854 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 202 [2020-11-07 00:41:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:13,856 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2020-11-07 00:41:13,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:41:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2020-11-07 00:41:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-11-07 00:41:13,862 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:13,863 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 6, 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:41:13,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:41:13,864 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:13,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2132540428, now seen corresponding path program 6 times [2020-11-07 00:41:13,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:13,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613629025] [2020-11-07 00:41:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:13,870 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 64 proven. 137 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2020-11-07 00:41:14,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613629025] [2020-11-07 00:41:14,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:14,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:41:14,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451800296] [2020-11-07 00:41:14,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:41:14,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:41:14,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:41:14,926 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 16 states. [2020-11-07 00:41:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:17,268 INFO L93 Difference]: Finished difference Result 334 states and 574 transitions. [2020-11-07 00:41:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 00:41:17,269 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 272 [2020-11-07 00:41:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:17,274 INFO L225 Difference]: With dead ends: 334 [2020-11-07 00:41:17,274 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 00:41:17,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=393, Invalid=1499, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 00:41:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 00:41:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2020-11-07 00:41:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-11-07 00:41:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2020-11-07 00:41:17,312 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 272 [2020-11-07 00:41:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:17,313 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2020-11-07 00:41:17,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:41:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2020-11-07 00:41:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2020-11-07 00:41:17,323 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:17,323 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:17,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:41:17,324 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1553933834, now seen corresponding path program 7 times [2020-11-07 00:41:17,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:17,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849339592] [2020-11-07 00:41:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:17,330 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:17,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:17,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:17,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:17,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:41:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:18,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2020-11-07 00:41:19,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849339592] [2020-11-07 00:41:19,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:19,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-07 00:41:19,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648098473] [2020-11-07 00:41:19,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 00:41:19,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:19,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 00:41:19,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:41:19,779 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand 23 states. [2020-11-07 00:41:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:22,929 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2020-11-07 00:41:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 00:41:22,930 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 378 [2020-11-07 00:41:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:22,934 INFO L225 Difference]: With dead ends: 159 [2020-11-07 00:41:22,934 INFO L226 Difference]: Without dead ends: 152 [2020-11-07 00:41:22,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=196, Invalid=2254, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 00:41:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-07 00:41:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2020-11-07 00:41:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 00:41:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2020-11-07 00:41:22,973 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 378 [2020-11-07 00:41:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:22,975 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2020-11-07 00:41:22,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 00:41:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2020-11-07 00:41:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2020-11-07 00:41:22,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:22,987 INFO L422 BasicCegarLoop]: trace histogram [57, 57, 46, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 18, 18, 11, 11, 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:41:22,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:41:22,987 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1694816162, now seen corresponding path program 8 times [2020-11-07 00:41:22,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:22,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [799213455] [2020-11-07 00:41:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:23,000 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:41:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 00:41:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 94 proven. 289 refuted. 0 times theorem prover too weak. 1561 trivial. 0 not checked. [2020-11-07 00:41:24,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [799213455] [2020-11-07 00:41:24,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:24,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:41:24,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868149350] [2020-11-07 00:41:24,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:41:24,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:24,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:41:24,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:24,888 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand 17 states. [2020-11-07 00:41:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:27,662 INFO L93 Difference]: Finished difference Result 278 states and 444 transitions. [2020-11-07 00:41:27,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-07 00:41:27,662 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 519 [2020-11-07 00:41:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:27,667 INFO L225 Difference]: With dead ends: 278 [2020-11-07 00:41:27,667 INFO L226 Difference]: Without dead ends: 166 [2020-11-07 00:41:27,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=461, Invalid=1701, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 00:41:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-11-07 00:41:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2020-11-07 00:41:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-07 00:41:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 200 transitions. [2020-11-07 00:41:27,702 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 200 transitions. Word has length 519 [2020-11-07 00:41:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:27,703 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 200 transitions. [2020-11-07 00:41:27,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:41:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 200 transitions. [2020-11-07 00:41:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2020-11-07 00:41:27,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:27,713 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 16, 16, 10, 10, 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:41:27,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:41:27,714 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash 520351719, now seen corresponding path program 9 times [2020-11-07 00:41:27,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:27,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355799487] [2020-11-07 00:41:27,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:27,719 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:41:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2020-11-07 00:41:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1516 backedges. 84 proven. 241 refuted. 0 times theorem prover too weak. 1191 trivial. 0 not checked. [2020-11-07 00:41:29,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355799487] [2020-11-07 00:41:29,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:29,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:41:29,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762361958] [2020-11-07 00:41:29,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:41:29,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:29,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:41:29,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:41:29,205 INFO L87 Difference]: Start difference. First operand 150 states and 200 transitions. Second operand 16 states. [2020-11-07 00:41:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:31,041 INFO L93 Difference]: Finished difference Result 284 states and 403 transitions. [2020-11-07 00:41:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:41:31,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 466 [2020-11-07 00:41:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:31,047 INFO L225 Difference]: With dead ends: 284 [2020-11-07 00:41:31,047 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 00:41:31,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 00:41:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 00:41:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2020-11-07 00:41:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 00:41:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 178 transitions. [2020-11-07 00:41:31,080 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 178 transitions. Word has length 466 [2020-11-07 00:41:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:31,081 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 178 transitions. [2020-11-07 00:41:31,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:41:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 178 transitions. [2020-11-07 00:41:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2020-11-07 00:41:31,097 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:31,098 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 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:41:31,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:41:31,098 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -240553225, now seen corresponding path program 10 times [2020-11-07 00:41:31,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:31,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1986322429] [2020-11-07 00:41:31,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:31,109 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:31,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:41:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-11-07 00:41:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:32,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2848 backedges. 2 proven. 239 refuted. 0 times theorem prover too weak. 2607 trivial. 0 not checked. [2020-11-07 00:41:33,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1986322429] [2020-11-07 00:41:33,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:33,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:41:33,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926187717] [2020-11-07 00:41:33,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:41:33,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:41:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:41:33,100 INFO L87 Difference]: Start difference. First operand 135 states and 178 transitions. Second operand 13 states. [2020-11-07 00:41:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:34,620 INFO L93 Difference]: Finished difference Result 244 states and 341 transitions. [2020-11-07 00:41:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 00:41:34,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 607 [2020-11-07 00:41:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:34,623 INFO L225 Difference]: With dead ends: 244 [2020-11-07 00:41:34,624 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:41:34,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2020-11-07 00:41:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:41:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:41:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:41:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:41:34,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 607 [2020-11-07 00:41:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:34,628 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:41:34,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:41:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:41:34,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:41:34,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:41:34,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:41:40,045 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 130 DAG size of output: 61 [2020-11-07 00:41:40,317 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 3 [2020-11-07 00:41:40,442 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 6 [2020-11-07 00:41:41,075 WARN L194 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 42 [2020-11-07 00:41:41,218 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 6 [2020-11-07 00:41:42,446 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 120 DAG size of output: 53 [2020-11-07 00:41:43,725 WARN L194 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 148 DAG size of output: 71 [2020-11-07 00:41:44,779 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 130 DAG size of output: 61 [2020-11-07 00:41:45,606 WARN L194 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 58 [2020-11-07 00:41:45,774 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 6 [2020-11-07 00:41:46,634 WARN L194 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 58 [2020-11-07 00:41:47,268 WARN L194 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 42 [2020-11-07 00:41:47,383 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 9 [2020-11-07 00:41:47,389 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,389 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,390 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,390 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,390 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,390 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,390 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:47,390 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:47,391 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,391 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:47,391 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,391 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,391 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:41:47,391 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:47,392 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:47,392 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:47,392 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:41:47,392 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:41:47,392 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 25 32) the Hoare annotation is: true [2020-11-07 00:41:47,392 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: false [2020-11-07 00:41:47,392 INFO L262 CegarLoopResult]: At program point L28(lines 28 30) the Hoare annotation is: (and (<= 7 main_~x~0) (< 12 main_~result~0) (<= main_~result~0 13)) [2020-11-07 00:41:47,392 INFO L262 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: false [2020-11-07 00:41:47,393 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 7 main_~x~0) (<= main_~x~0 7)) [2020-11-07 00:41:47,393 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 13 |main_#t~ret9|) (<= 7 main_~x~0) (<= |main_#t~ret9| 13)) [2020-11-07 00:41:47,393 INFO L262 CegarLoopResult]: At program point L28-2(lines 28 30) the Hoare annotation is: (<= 7 main_~x~0) [2020-11-07 00:41:47,393 INFO L262 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= 13 |main_#t~ret9|) (<= 7 main_~x~0) (<= |main_#t~ret9| 13)) [2020-11-07 00:41:47,393 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 25 32) the Hoare annotation is: (<= 7 main_~x~0) [2020-11-07 00:41:47,393 INFO L262 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= 13 |main_#t~ret9|) (<= 7 main_~x~0) (< 12 main_~result~0) (<= main_~result~0 13) (<= |main_#t~ret9| 13)) [2020-11-07 00:41:47,393 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 25 32) the Hoare annotation is: (<= 7 main_~x~0) [2020-11-07 00:41:47,394 INFO L262 CegarLoopResult]: At program point fiboEXIT(lines 7 15) the Hoare annotation is: (let ((.cse0 (<= 1 |fibo_#res|)) (.cse1 (<= |fibo_#res| 1))) (and (or (and .cse0 .cse1) (<= |fibo_#in~n| 0) (not (<= |fibo_#in~n| 1))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (< 0 fibo_~n)) (let ((.cse2 (= fibo_~n |fibo_#in~n|))) (or (and (<= fibo_~n 6) .cse2) (and (<= 13 |fibo_#res|) (<= |fibo_#res| 13) .cse2) (and .cse2 (<= 8 |fibo_#in~n|)))) (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and (<= |fibo_#res| 8) (<= 8 |fibo_#res|) (<= 6 |fibo_#in~n|)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#in~n| 5) (<= |fibo_#res| 5)) (not (<= 2 |fibo_#in~n|)) (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)) (and .cse0 .cse1 (<= |fibo_#in~n| 2)) (<= 7 |fibo_#in~n|)))) [2020-11-07 00:41:47,394 INFO L262 CegarLoopResult]: At program point fiboFINAL(lines 7 15) the Hoare annotation is: (let ((.cse0 (<= 1 |fibo_#res|)) (.cse1 (<= |fibo_#res| 1))) (and (or (and .cse0 .cse1) (<= |fibo_#in~n| 0) (not (<= |fibo_#in~n| 1))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (< 0 fibo_~n)) (let ((.cse2 (= fibo_~n |fibo_#in~n|))) (or (and (<= fibo_~n 6) .cse2) (and (<= 13 |fibo_#res|) (<= |fibo_#res| 13) .cse2) (and .cse2 (<= 8 |fibo_#in~n|)))) (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and (<= |fibo_#res| 8) (<= 8 |fibo_#res|) (<= 6 |fibo_#in~n|)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#in~n| 5) (<= |fibo_#res| 5)) (not (<= 2 |fibo_#in~n|)) (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)) (and .cse0 .cse1 (<= |fibo_#in~n| 2)) (<= 7 |fibo_#in~n|)))) [2020-11-07 00:41:47,394 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 |fibo_#in~n|) (= fibo_~n |fibo_#in~n|)) [2020-11-07 00:41:47,395 INFO L262 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (<= 5 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 5) (<= |fibo_#in~n| 6) .cse0 (<= 6 |fibo_#in~n|)) (and .cse1 (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#in~n| 2) .cse0) (and .cse1 .cse2 (<= 3 |fibo_#in~n|) .cse0 (<= |fibo_#in~n| 3)) (and .cse0 (<= 8 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) .cse0 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse0 (<= |fibo_#in~n| 5) (<= 3 |fibo_#t~ret7|)) (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|) (<= 7 fibo_~n) .cse0))) [2020-11-07 00:41:47,395 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (< 0 fibo_~n) (not (<= 2 |fibo_#in~n|)) (= fibo_~n |fibo_#in~n|)) [2020-11-07 00:41:47,395 INFO L262 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (<= 5 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 5) (<= |fibo_#in~n| 6) .cse0 (<= 6 |fibo_#in~n|)) (and .cse1 (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#in~n| 2) .cse0) (and .cse1 .cse2 (<= 3 |fibo_#in~n|) .cse0 (<= |fibo_#in~n| 3)) (and .cse0 (<= 8 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) .cse0 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse0 (<= |fibo_#in~n| 5) (<= 3 |fibo_#t~ret7|)) (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|) (<= 7 fibo_~n) .cse0))) [2020-11-07 00:41:47,395 INFO L262 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-11-07 00:41:47,396 INFO L262 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse0 (<= |fibo_#t~ret7| 1)) (.cse1 (+ |fibo_#t~ret8| |fibo_#t~ret7|)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse3 (= fibo_~n |fibo_#in~n|))) (or (and .cse0 (<= 1 .cse1) (<= .cse1 1) (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#in~n| 2) .cse3) (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|) (<= .cse1 13) (<= 13 .cse1) (<= 7 |fibo_#in~n|) .cse3) (and .cse3 (<= 8 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse1) (<= .cse1 3) .cse3 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 8 .cse1) (<= 5 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 5) (<= |fibo_#in~n| 6) .cse3 (<= .cse1 8) (<= 6 |fibo_#in~n|)) (and (<= 5 .cse1) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse3 (<= |fibo_#in~n| 5) (<= 3 |fibo_#t~ret7|) (<= .cse1 5)) (and (<= .cse1 2) .cse0 (<= 2 .cse1) .cse2 (<= 3 |fibo_#in~n|) .cse3 (<= |fibo_#in~n| 3)))) [2020-11-07 00:41:47,396 INFO L262 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo_#in~n| 0) (= fibo_~n |fibo_#in~n|)) [2020-11-07 00:41:47,396 INFO L262 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse0 (<= |fibo_#t~ret7| 1)) (.cse1 (+ |fibo_#t~ret8| |fibo_#t~ret7|)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse3 (= fibo_~n |fibo_#in~n|))) (or (and .cse0 (<= 1 .cse1) (<= .cse1 1) (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#in~n| 2) .cse3) (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|) (<= .cse1 13) (<= 13 .cse1) (<= 7 |fibo_#in~n|) .cse3) (and .cse3 (<= 8 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse1) (<= .cse1 3) .cse3 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 8 .cse1) (<= 5 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 5) (<= |fibo_#in~n| 6) .cse3 (<= .cse1 8) (<= 6 |fibo_#in~n|)) (and (<= 5 .cse1) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse3 (<= |fibo_#in~n| 5) (<= 3 |fibo_#t~ret7|) (<= .cse1 5)) (and (<= .cse1 2) .cse0 (<= 2 .cse1) .cse2 (<= 3 |fibo_#in~n|) .cse3 (<= |fibo_#in~n| 3)))) [2020-11-07 00:41:47,397 INFO L262 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo_~n |fibo_#in~n|) [2020-11-07 00:41:47,397 INFO L262 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (and (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse0 (+ |fibo_#t~ret8| |fibo_#t~ret7|))) (or (and (<= .cse0 2) .cse1 (<= 2 |fibo_#res|) (<= 2 .cse0) .cse2 (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and (<= 8 .cse0) (<= |fibo_#res| 8) (<= 5 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 5) (<= 8 |fibo_#res|) (<= |fibo_#in~n| 6) (<= .cse0 8) (<= 6 |fibo_#in~n|)) (and (<= 5 |fibo_#res|) (<= 5 .cse0) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) (<= |fibo_#in~n| 5) (<= 3 |fibo_#t~ret7|) (<= .cse0 5) (<= |fibo_#res| 5)) (and (<= |fibo_#t~ret7| 8) (<= 13 |fibo_#res|) (<= 8 |fibo_#t~ret7|) (<= .cse0 13) (<= 13 .cse0) (<= 7 |fibo_#in~n|) (<= |fibo_#res| 13)) (and (<= 1 |fibo_#res|) .cse1 (<= 1 .cse0) (<= .cse0 1) (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#res| 1) (<= |fibo_#in~n| 2)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse0) (<= |fibo_#res| 3) (<= .cse0 3) (<= 3 |fibo_#res|) (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (<= 8 |fibo_#in~n|))) (= fibo_~n |fibo_#in~n|)) [2020-11-07 00:41:47,397 INFO L262 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse3 (<= |fibo_#in~n| 2)) (.cse4 (= fibo_~n |fibo_#in~n|))) (let ((.cse1 (and (<= 1 |fibo_#res|) (<= 2 |fibo_#in~n|) (<= |fibo_#res| 1) .cse3 .cse4)) (.cse2 (<= 4 |fibo_#in~n|)) (.cse0 (<= |fibo_#in~n| 4))) (and (or (and (<= |fibo_#res| 8) (<= 8 |fibo_#res|) (<= 6 |fibo_#in~n|)) .cse0 (and (<= 5 |fibo_#res|) (<= |fibo_#in~n| 5) (<= |fibo_#res| 5)) (<= 7 |fibo_#in~n|)) (or .cse1 (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2)) .cse2) (or (not .cse3) .cse1) (or (and (<= fibo_~n 6) .cse4) (and (<= 13 |fibo_#res|) (<= |fibo_#res| 13) .cse4) (and .cse4 (<= 8 |fibo_#in~n|))) (or (not .cse2) (not .cse0) (and (<= |fibo_#res| 3) (<= 3 |fibo_#res|)))))) [2020-11-07 00:41:47,397 INFO L269 CegarLoopResult]: At program point fiboENTRY(lines 7 15) the Hoare annotation is: true [2020-11-07 00:41:47,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:41:47 BoogieIcfgContainer [2020-11-07 00:41:47,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:41:47,423 INFO L168 Benchmark]: Toolchain (without parser) took 41238.67 ms. Allocated memory was 158.3 MB in the beginning and 619.7 MB in the end (delta: 461.4 MB). Free memory was 134.2 MB in the beginning and 306.6 MB in the end (delta: -172.4 MB). Peak memory consumption was 366.9 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:47,424 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 158.3 MB. Free memory is still 133.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:41:47,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.40 ms. Allocated memory is still 158.3 MB. Free memory was 133.6 MB in the beginning and 124.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:47,425 INFO L168 Benchmark]: Boogie Preprocessor took 43.77 ms. Allocated memory is still 158.3 MB. Free memory was 124.7 MB in the beginning and 123.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:47,426 INFO L168 Benchmark]: RCFGBuilder took 412.30 ms. Allocated memory is still 158.3 MB. Free memory was 123.4 MB in the beginning and 109.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:47,426 INFO L168 Benchmark]: TraceAbstraction took 40522.11 ms. Allocated memory was 158.3 MB in the beginning and 619.7 MB in the end (delta: 461.4 MB). Free memory was 108.7 MB in the beginning and 306.6 MB in the end (delta: -197.9 MB). Peak memory consumption was 341.8 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:47,429 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.24 ms. Allocated memory is still 158.3 MB. Free memory is still 133.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 246.40 ms. Allocated memory is still 158.3 MB. Free memory was 133.6 MB in the beginning and 124.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.77 ms. Allocated memory is still 158.3 MB. Free memory was 124.7 MB in the beginning and 123.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 412.30 ms. Allocated memory is still 158.3 MB. Free memory was 123.4 MB in the beginning and 109.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 40522.11 ms. Allocated memory was 158.3 MB in the beginning and 619.7 MB in the end (delta: 461.4 MB). Free memory was 108.7 MB in the beginning and 306.6 MB in the end (delta: -197.9 MB). Peak memory consumption was 341.8 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: 25]: Procedure Contract for main Derived contract for procedure main: 7 <= x - ProcedureContractResult [Line: 7]: Procedure Contract for fibo Derived contract for procedure fibo: (((((1 <= \result && \result <= 1) || \old(n) <= 0) || !(\old(n) <= 1)) && ((0 <= \result && \result <= 0) || 0 < n)) && (((n <= 6 && n == \old(n)) || ((13 <= \result && \result <= 13) && n == \old(n))) || (n == \old(n) && 8 <= \old(n)))) && (((((((((2 <= \result && \result <= 2) && 3 <= \old(n)) && \old(n) <= 3) || ((\result <= 8 && 8 <= \result) && 6 <= \old(n))) || (((5 <= \result && 5 <= \old(n)) && \old(n) <= 5) && \result <= 5)) || !(2 <= \old(n))) || (((\old(n) <= 4 && \result <= 3) && 3 <= \result) && 4 <= \old(n))) || ((1 <= \result && \result <= 1) && \old(n) <= 2)) || 7 <= \old(n)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.6s, OverallIterations: 13, TraceHistogramMax: 67, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 603 SDtfs, 1149 SDslu, 1235 SDs, 0 SdLazy, 4441 SolverSat, 768 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 123 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 1575 PreInvPairs, 2834 NumberOfFragments, 1207 HoareAnnotationTreeSize, 1575 FomulaSimplifications, 73414 FormulaSimplificationTreeSizeReduction, 4.3s HoareSimplificationTime, 43 FomulaSimplificationsInter, 40003 FormulaSimplificationTreeSizeReductionInter, 8.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...