/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:39:53,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:39:53,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:39:53,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:39:53,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:39:53,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:39:53,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:39:53,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:39:53,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:39:53,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:39:53,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:39:53,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:39:53,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:39:53,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:39:53,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:39:53,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:39:53,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:39:53,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:39:53,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:39:53,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:39:53,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:39:53,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:39:53,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:39:53,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:39:53,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:39:53,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:39:53,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:39:53,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:39:53,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:39:53,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:39:53,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:39:53,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:39:53,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:39:53,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:39:53,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:39:53,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:39:53,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:39:53,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:39:53,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:39:53,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:39:53,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:39:53,818 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:39:53,841 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:39:53,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:39:53,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:39:53,845 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:39:53,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:39:53,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:39:53,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:39:53,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:39:53,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:39:53,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:39:53,848 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:39:53,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:39:53,848 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:39:53,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:39:53,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:39:53,849 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:39:53,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:39:53,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:39:53,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:39:53,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:39:53,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:39:53,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:39:53,851 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:39:54,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:39:54,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:39:54,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:39:54,294 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:39:54,295 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:39:54,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-11-07 00:39:54,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd40ef56/4a7a85be31734444a54f84dd1755aa86/FLAG15b66f548 [2020-11-07 00:39:55,121 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:39:55,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-11-07 00:39:55,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd40ef56/4a7a85be31734444a54f84dd1755aa86/FLAG15b66f548 [2020-11-07 00:39:55,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd40ef56/4a7a85be31734444a54f84dd1755aa86 [2020-11-07 00:39:55,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:39:55,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:39:55,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:39:55,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:39:55,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:39:55,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:39:55" (1/1) ... [2020-11-07 00:39:55,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545e12b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55, skipping insertion in model container [2020-11-07 00:39:55,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:39:55" (1/1) ... [2020-11-07 00:39:55,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:39:55,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:39:55,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:39:55,789 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:39:55,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:39:55,840 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:39:55,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55 WrapperNode [2020-11-07 00:39:55,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:39:55,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:39:55,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:39:55,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:39:55,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55" (1/1) ... [2020-11-07 00:39:55,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55" (1/1) ... [2020-11-07 00:39:55,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55" (1/1) ... [2020-11-07 00:39:55,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55" (1/1) ... [2020-11-07 00:39:55,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55" (1/1) ... [2020-11-07 00:39:55,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55" (1/1) ... [2020-11-07 00:39:55,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55" (1/1) ... [2020-11-07 00:39:55,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:39:55,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:39:55,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:39:55,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:39:55,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55" (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:39:55,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:39:55,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:39:55,976 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:39:55,976 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 00:39:55,976 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 00:39:55,976 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:39:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:39:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:39:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:39:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:39:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:39:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 00:39:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 00:39:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:39:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:39:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:39:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:39:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:39:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:39:55,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:39:56,372 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:39:56,372 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:39:56,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:39:56 BoogieIcfgContainer [2020-11-07 00:39:56,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:39:56,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:39:56,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:39:56,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:39:56,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:39:55" (1/3) ... [2020-11-07 00:39:56,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139624f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:39:56, skipping insertion in model container [2020-11-07 00:39:56,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:55" (2/3) ... [2020-11-07 00:39:56,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139624f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:39:56, skipping insertion in model container [2020-11-07 00:39:56,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:39:56" (3/3) ... [2020-11-07 00:39:56,387 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2020-11-07 00:39:56,418 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:39:56,427 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:39:56,472 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:39:56,524 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:39:56,524 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:39:56,524 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:39:56,524 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:39:56,524 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:39:56,525 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:39:56,525 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:39:56,525 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:39:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 00:39:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:39:56,559 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:56,560 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:39:56,561 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:56,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:56,571 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 00:39:56,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:56,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272407966] [2020-11-07 00:39:56,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:56,679 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:56,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:56,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:57,009 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:39:57,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272407966] [2020-11-07 00:39:57,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:57,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:39:57,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159740694] [2020-11-07 00:39:57,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:39:57,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:57,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:39:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:39:57,050 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 00:39:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:57,570 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-11-07 00:39:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:39:57,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:39:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:57,589 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:39:57,590 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 00:39:57,595 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:39:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 00:39:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 00:39:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:39:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:39:57,671 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 00:39:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:57,672 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:39:57,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:39:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:39:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:39:57,676 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:57,677 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:39:57,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:39:57,678 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:57,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 00:39:57,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:57,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [511991274] [2020-11-07 00:39:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:57,685 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:57,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:57,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:57,898 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:39:57,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [511991274] [2020-11-07 00:39:57,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:57,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:39:57,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197761823] [2020-11-07 00:39:57,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:39:57,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:57,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:39:57,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:39:57,909 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 00:39:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:58,344 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 00:39:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:39:58,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:39:58,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:58,350 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:39:58,350 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:39:58,354 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:39:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:39:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:39:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:39:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:39:58,399 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 00:39:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:58,400 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:39:58,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:39:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:39:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:39:58,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:58,403 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:58,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:39:58,403 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:58,404 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 00:39:58,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:58,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684944965] [2020-11-07 00:39:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:58,408 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:58,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:58,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:58,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:58,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:39:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:39:58,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [684944965] [2020-11-07 00:39:58,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:58,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:39:58,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358261263] [2020-11-07 00:39:58,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:39:58,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:39:58,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:39:58,588 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 00:39:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:58,926 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 00:39:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:39:58,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:39:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:58,929 INFO L225 Difference]: With dead ends: 92 [2020-11-07 00:39:58,930 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 00:39:58,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:39:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 00:39:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 00:39:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 00:39:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 00:39:58,947 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 00:39:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:58,948 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 00:39:58,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:39:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 00:39:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:39:58,950 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:58,951 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:58,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:39:58,951 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 00:39:58,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:58,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644786550] [2020-11-07 00:39:58,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:58,955 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:39:59,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1644786550] [2020-11-07 00:39:59,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:59,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:39:59,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207171794] [2020-11-07 00:39:59,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:39:59,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:39:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:39:59,160 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 00:39:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:59,713 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 00:39:59,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:39:59,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 00:39:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:59,717 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:39:59,717 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:39:59,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:39:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:39:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 00:39:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 00:39:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 00:39:59,741 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 00:39:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:59,742 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 00:39:59,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:39:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 00:39:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 00:39:59,745 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:59,745 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:59,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:39:59,746 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:59,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 00:39:59,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:59,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1124054926] [2020-11-07 00:39:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:59,750 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:39:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 00:39:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:39:59,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1124054926] [2020-11-07 00:39:59,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:59,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:39:59,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105285927] [2020-11-07 00:39:59,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:39:59,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:59,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:39:59,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:39:59,898 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 00:40:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:00,263 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 00:40:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:00,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 00:40:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:00,266 INFO L225 Difference]: With dead ends: 140 [2020-11-07 00:40:00,266 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:40:00,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:40:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:40:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:40:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:40:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 00:40:00,292 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 00:40:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:00,292 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 00:40:00,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:40:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 00:40:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:40:00,295 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:00,296 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:00,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:40:00,296 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:00,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 00:40:00,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:00,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342938049] [2020-11-07 00:40:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:00,300 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:00,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:00,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:00,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:00,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:00,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:00,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:40:00,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342938049] [2020-11-07 00:40:00,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:00,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:40:00,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207648893] [2020-11-07 00:40:00,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:40:00,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:40:00,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:40:00,467 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 00:40:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:01,019 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 00:40:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:40:01,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:40:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:01,023 INFO L225 Difference]: With dead ends: 152 [2020-11-07 00:40:01,023 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 00:40:01,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:40:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 00:40:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 00:40:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 00:40:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 00:40:01,051 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 00:40:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:01,052 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 00:40:01,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:40:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 00:40:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:40:01,054 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:01,055 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:01,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:40:01,055 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 00:40:01,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:01,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [863865461] [2020-11-07 00:40:01,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:01,059 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:01,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:01,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:01,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:01,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:01,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:01,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:40:01,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [863865461] [2020-11-07 00:40:01,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:01,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:40:01,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669303219] [2020-11-07 00:40:01,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:40:01,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:40:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:01,225 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 00:40:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:02,064 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 00:40:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:40:02,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 00:40:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:02,071 INFO L225 Difference]: With dead ends: 128 [2020-11-07 00:40:02,071 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 00:40:02,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 00:40:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 00:40:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 00:40:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 00:40:02,132 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 00:40:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:02,134 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 00:40:02,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:40:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 00:40:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 00:40:02,137 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:02,138 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:02,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:40:02,138 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:02,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 00:40:02,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:02,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1306385541] [2020-11-07 00:40:02,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:02,146 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:02,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:02,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:02,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:02,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:02,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:02,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:02,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:02,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 00:40:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:40:02,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1306385541] [2020-11-07 00:40:02,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:02,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:40:02,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766296784] [2020-11-07 00:40:02,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:40:02,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:40:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:02,472 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 00:40:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:03,180 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 00:40:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:03,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 00:40:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:03,184 INFO L225 Difference]: With dead ends: 237 [2020-11-07 00:40:03,185 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 00:40:03,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:40:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 00:40:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 00:40:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:40:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 00:40:03,229 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 00:40:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:03,230 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 00:40:03,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:40:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 00:40:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 00:40:03,232 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:03,233 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:03,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:40:03,233 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:03,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 00:40:03,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:03,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [80117154] [2020-11-07 00:40:03,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:03,238 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:03,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:03,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:03,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:03,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:03,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:03,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:03,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:03,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:40:03,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [80117154] [2020-11-07 00:40:03,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:03,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:03,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601018101] [2020-11-07 00:40:03,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:03,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:03,468 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-11-07 00:40:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:04,330 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 00:40:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:04,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-07 00:40:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:04,339 INFO L225 Difference]: With dead ends: 267 [2020-11-07 00:40:04,340 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 00:40:04,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 00:40:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 00:40:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 00:40:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 00:40:04,427 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 00:40:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:04,428 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 00:40:04,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 00:40:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 00:40:04,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:04,436 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:04,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:40:04,437 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-11-07 00:40:04,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:04,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [116073205] [2020-11-07 00:40:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:04,442 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-07 00:40:04,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [116073205] [2020-11-07 00:40:04,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:04,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:04,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761038115] [2020-11-07 00:40:04,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:04,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:04,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:04,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:04,795 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-11-07 00:40:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:05,735 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-11-07 00:40:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:40:05,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2020-11-07 00:40:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:05,748 INFO L225 Difference]: With dead ends: 223 [2020-11-07 00:40:05,748 INFO L226 Difference]: Without dead ends: 216 [2020-11-07 00:40:05,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:40:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-07 00:40:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-11-07 00:40:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-07 00:40:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-11-07 00:40:05,841 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 96 [2020-11-07 00:40:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:05,842 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-11-07 00:40:05,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-11-07 00:40:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 00:40:05,847 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:05,847 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:05,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:40:05,848 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash -375801608, now seen corresponding path program 2 times [2020-11-07 00:40:05,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:05,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1186512341] [2020-11-07 00:40:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:05,855 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:05,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:05,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 00:40:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 00:40:06,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1186512341] [2020-11-07 00:40:06,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:06,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:40:06,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608346117] [2020-11-07 00:40:06,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:40:06,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:40:06,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:40:06,272 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 11 states. [2020-11-07 00:40:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:07,228 INFO L93 Difference]: Finished difference Result 459 states and 784 transitions. [2020-11-07 00:40:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:40:07,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2020-11-07 00:40:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:07,233 INFO L225 Difference]: With dead ends: 459 [2020-11-07 00:40:07,233 INFO L226 Difference]: Without dead ends: 266 [2020-11-07 00:40:07,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:40:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-11-07 00:40:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 236. [2020-11-07 00:40:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-11-07 00:40:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 364 transitions. [2020-11-07 00:40:07,292 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 364 transitions. Word has length 132 [2020-11-07 00:40:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:07,293 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 364 transitions. [2020-11-07 00:40:07,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:40:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2020-11-07 00:40:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-07 00:40:07,298 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:07,298 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:07,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:40:07,299 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash -62145750, now seen corresponding path program 2 times [2020-11-07 00:40:07,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:07,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1904084097] [2020-11-07 00:40:07,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:07,302 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 00:40:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-11-07 00:40:07,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1904084097] [2020-11-07 00:40:07,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:07,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:40:07,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376870857] [2020-11-07 00:40:07,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:40:07,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:07,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:40:07,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:40:07,678 INFO L87 Difference]: Start difference. First operand 236 states and 364 transitions. Second operand 13 states. [2020-11-07 00:40:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:09,280 INFO L93 Difference]: Finished difference Result 465 states and 787 transitions. [2020-11-07 00:40:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:40:09,282 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 150 [2020-11-07 00:40:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:09,286 INFO L225 Difference]: With dead ends: 465 [2020-11-07 00:40:09,286 INFO L226 Difference]: Without dead ends: 214 [2020-11-07 00:40:09,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:40:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-11-07 00:40:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 186. [2020-11-07 00:40:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-07 00:40:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2020-11-07 00:40:09,336 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 150 [2020-11-07 00:40:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:09,337 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2020-11-07 00:40:09,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:40:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2020-11-07 00:40:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-11-07 00:40:09,340 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:09,341 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:09,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:40:09,341 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1394104132, now seen corresponding path program 3 times [2020-11-07 00:40:09,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:09,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1560242646] [2020-11-07 00:40:09,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:09,345 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:40:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2020-11-07 00:40:09,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1560242646] [2020-11-07 00:40:09,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:09,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:40:09,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200687724] [2020-11-07 00:40:09,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:40:09,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:09,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:40:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:40:09,889 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand 16 states. [2020-11-07 00:40:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:12,276 INFO L93 Difference]: Finished difference Result 360 states and 513 transitions. [2020-11-07 00:40:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 00:40:12,277 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 167 [2020-11-07 00:40:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:12,283 INFO L225 Difference]: With dead ends: 360 [2020-11-07 00:40:12,283 INFO L226 Difference]: Without dead ends: 192 [2020-11-07 00:40:12,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=1296, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 00:40:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-11-07 00:40:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2020-11-07 00:40:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-11-07 00:40:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 233 transitions. [2020-11-07 00:40:12,335 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 233 transitions. Word has length 167 [2020-11-07 00:40:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:12,336 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 233 transitions. [2020-11-07 00:40:12,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:40:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 233 transitions. [2020-11-07 00:40:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-07 00:40:12,340 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:12,340 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:12,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:40:12,340 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:12,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:12,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1978690859, now seen corresponding path program 4 times [2020-11-07 00:40:12,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:12,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [106200740] [2020-11-07 00:40:12,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:12,353 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-07 00:40:12,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [106200740] [2020-11-07 00:40:12,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:12,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:40:12,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166756506] [2020-11-07 00:40:12,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:40:12,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:12,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:40:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:40:12,676 INFO L87 Difference]: Start difference. First operand 180 states and 233 transitions. Second operand 12 states. [2020-11-07 00:40:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:13,823 INFO L93 Difference]: Finished difference Result 350 states and 472 transitions. [2020-11-07 00:40:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:40:13,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 131 [2020-11-07 00:40:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:13,828 INFO L225 Difference]: With dead ends: 350 [2020-11-07 00:40:13,828 INFO L226 Difference]: Without dead ends: 191 [2020-11-07 00:40:13,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:40:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-11-07 00:40:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2020-11-07 00:40:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-11-07 00:40:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 248 transitions. [2020-11-07 00:40:13,876 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 248 transitions. Word has length 131 [2020-11-07 00:40:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:13,876 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 248 transitions. [2020-11-07 00:40:13,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:40:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 248 transitions. [2020-11-07 00:40:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 00:40:13,879 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:13,879 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:13,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:40:13,880 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash -139933889, now seen corresponding path program 5 times [2020-11-07 00:40:13,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:13,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719768716] [2020-11-07 00:40:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:13,883 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 00:40:14,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719768716] [2020-11-07 00:40:14,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:14,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-07 00:40:14,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179338153] [2020-11-07 00:40:14,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 00:40:14,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 00:40:14,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:40:14,858 INFO L87 Difference]: Start difference. First operand 191 states and 248 transitions. Second operand 23 states. [2020-11-07 00:40:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:18,294 INFO L93 Difference]: Finished difference Result 216 states and 279 transitions. [2020-11-07 00:40:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-07 00:40:18,295 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 149 [2020-11-07 00:40:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:18,299 INFO L225 Difference]: With dead ends: 216 [2020-11-07 00:40:18,299 INFO L226 Difference]: Without dead ends: 209 [2020-11-07 00:40:18,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=220, Invalid=2536, Unknown=0, NotChecked=0, Total=2756 [2020-11-07 00:40:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-11-07 00:40:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2020-11-07 00:40:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-11-07 00:40:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 260 transitions. [2020-11-07 00:40:18,350 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 260 transitions. Word has length 149 [2020-11-07 00:40:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:18,350 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 260 transitions. [2020-11-07 00:40:18,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 00:40:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2020-11-07 00:40:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2020-11-07 00:40:18,357 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:18,357 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:18,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:40:18,358 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:18,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash 806507396, now seen corresponding path program 6 times [2020-11-07 00:40:18,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:18,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [312580626] [2020-11-07 00:40:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:18,364 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:40:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:18,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 1 proven. 85 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2020-11-07 00:40:19,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [312580626] [2020-11-07 00:40:19,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:19,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:40:19,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594412839] [2020-11-07 00:40:19,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:40:19,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:19,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:40:19,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:40:19,096 INFO L87 Difference]: Start difference. First operand 199 states and 260 transitions. Second operand 12 states. [2020-11-07 00:40:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:20,363 INFO L93 Difference]: Finished difference Result 248 states and 324 transitions. [2020-11-07 00:40:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:40:20,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 290 [2020-11-07 00:40:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:20,371 INFO L225 Difference]: With dead ends: 248 [2020-11-07 00:40:20,372 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 00:40:20,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:40:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 00:40:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-07 00:40:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 00:40:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2020-11-07 00:40:20,399 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 290 [2020-11-07 00:40:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:20,400 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2020-11-07 00:40:20,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:40:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2020-11-07 00:40:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 00:40:20,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:20,403 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-11-07 00:40:20,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:40:20,403 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash -720449366, now seen corresponding path program 7 times [2020-11-07 00:40:20,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:20,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1453104746] [2020-11-07 00:40:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:20,407 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-11-07 00:40:20,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1453104746] [2020-11-07 00:40:20,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:20,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:40:20,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488171080] [2020-11-07 00:40:20,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:40:20,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:20,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:40:20,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:40:20,973 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 15 states. [2020-11-07 00:40:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:22,709 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2020-11-07 00:40:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:40:22,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 184 [2020-11-07 00:40:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:22,711 INFO L225 Difference]: With dead ends: 112 [2020-11-07 00:40:22,712 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:40:22,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:40:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:40:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:40:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:40:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:40:22,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2020-11-07 00:40:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:22,714 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:40:22,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:40:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:40:22,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:40:22,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:40:22,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:40:32,670 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 8 [2020-11-07 00:40:32,886 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 6 [2020-11-07 00:40:33,081 WARN L194 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 7 [2020-11-07 00:40:33,588 WARN L194 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 28 [2020-11-07 00:40:33,764 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 6 [2020-11-07 00:40:34,768 WARN L194 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 43 [2020-11-07 00:40:35,624 WARN L194 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 36 [2020-11-07 00:40:36,110 WARN L194 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 28 [2020-11-07 00:40:37,071 WARN L194 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 35 [2020-11-07 00:40:38,034 WARN L194 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 35 [2020-11-07 00:40:38,183 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 6 [2020-11-07 00:40:38,787 WARN L194 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 22 [2020-11-07 00:40:39,427 WARN L194 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 34 [2020-11-07 00:40:40,248 WARN L194 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 34 [2020-11-07 00:40:40,366 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 3 [2020-11-07 00:40:41,023 WARN L194 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 34 [2020-11-07 00:40:41,177 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 6 [2020-11-07 00:40:42,746 WARN L194 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 156 DAG size of output: 38 [2020-11-07 00:40:42,918 WARN L194 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 6 [2020-11-07 00:40:43,451 WARN L194 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 22 [2020-11-07 00:40:44,247 WARN L194 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 34 [2020-11-07 00:40:44,969 WARN L194 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 40 [2020-11-07 00:40:45,514 WARN L194 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 28 [2020-11-07 00:40:45,743 WARN L194 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 8 [2020-11-07 00:40:47,281 WARN L194 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 156 DAG size of output: 38 [2020-11-07 00:40:47,489 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,489 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,489 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,489 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,489 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,490 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,490 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:40:47,490 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:40:47,490 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,490 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:40:47,491 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,491 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,491 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:40:47,491 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:40:47,491 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:40:47,491 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:40:47,491 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:40:47,491 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:40:47,492 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-11-07 00:40:47,492 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (<= 5 main_~x~0) [2020-11-07 00:40:47,492 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (<= 5 main_~x~0) [2020-11-07 00:40:47,492 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-11-07 00:40:47,492 INFO L262 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-11-07 00:40:47,492 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-11-07 00:40:47,492 INFO L262 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-11-07 00:40:47,492 INFO L262 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= |main_#t~ret11| 5) (<= 5 |main_#t~ret11|)) [2020-11-07 00:40:47,493 INFO L262 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-11-07 00:40:47,493 INFO L262 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= |main_#t~ret11| 5) (<= 5 |main_#t~ret11|)) [2020-11-07 00:40:47,493 INFO L262 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5) (<= |main_#t~ret11| 5) (<= 5 |main_#t~ret11|)) [2020-11-07 00:40:47,493 INFO L269 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-11-07 00:40:47,493 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 00:40:47,493 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= fibo2_~n 3) (<= |fibo2_#t~ret9| 1) .cse0 (<= 1 |fibo2_#t~ret9|)) (and (<= |fibo2_#t~ret9| 2) (<= 4 fibo2_~n) .cse0 (<= 2 |fibo2_#t~ret9|)) (and .cse0 (<= 5 |fibo2_#in~n|)))) (< 1 fibo2_~n)) [2020-11-07 00:40:47,493 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1) (< 0 fibo2_~n)) [2020-11-07 00:40:47,493 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= fibo2_~n 3) (<= |fibo2_#t~ret9| 1) .cse0 (<= 1 |fibo2_#t~ret9|)) (and (<= |fibo2_#t~ret9| 2) (<= 4 fibo2_~n) .cse0 (<= 2 |fibo2_#t~ret9|)) (and .cse0 (<= 5 |fibo2_#in~n|)))) (< 1 fibo2_~n)) [2020-11-07 00:40:47,493 INFO L262 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-11-07 00:40:47,494 INFO L262 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#t~ret9| 1)) (.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|)) (.cse2 (<= 1 |fibo2_#t~ret9|)) (.cse3 (<= |fibo2_#in~n| 2))) (and (= fibo2_~n |fibo2_#in~n|) (or (and .cse0 (<= .cse1 1) .cse2 (<= 1 .cse1)) (not .cse3)) (or (not (<= |fibo2_#in~n| 4)) (and (<= .cse1 3) (<= |fibo2_#t~ret9| 2) (<= 4 |fibo2_#in~n|) (<= 3 .cse1) (<= 2 |fibo2_#t~ret9|)) (and (<= 2 .cse1) (<= fibo2_~n 3) .cse0 (<= .cse1 2) .cse2) .cse3) (not (<= |fibo2_#in~n| 1)))) [2020-11-07 00:40:47,494 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-11-07 00:40:47,494 INFO L262 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#t~ret9| 1)) (.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|)) (.cse2 (<= 1 |fibo2_#t~ret9|)) (.cse3 (<= |fibo2_#in~n| 2))) (and (= fibo2_~n |fibo2_#in~n|) (or (and .cse0 (<= .cse1 1) .cse2 (<= 1 .cse1)) (not .cse3)) (or (not (<= |fibo2_#in~n| 4)) (and (<= .cse1 3) (<= |fibo2_#t~ret9| 2) (<= 4 |fibo2_#in~n|) (<= 3 .cse1) (<= 2 |fibo2_#t~ret9|)) (and (<= 2 .cse1) (<= fibo2_~n 3) .cse0 (<= .cse1 2) .cse2) .cse3) (not (<= |fibo2_#in~n| 1)))) [2020-11-07 00:40:47,494 INFO L262 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-11-07 00:40:47,494 INFO L262 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (and (let ((.cse1 (<= |fibo2_#t~ret9| 1)) (.cse0 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|)) (.cse2 (<= 1 |fibo2_#t~ret9|))) (or (and (<= .cse0 3) (<= |fibo2_#t~ret9| 2) (<= 4 |fibo2_#in~n|) (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) (<= 3 .cse0) (<= 2 |fibo2_#t~ret9|)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse1 (<= .cse0 1) .cse2 (<= 1 .cse0) (<= |fibo2_#in~n| 2)) (<= 5 |fibo2_#in~n|) (and (<= 2 .cse0) (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|) (<= fibo2_~n 3) .cse1 (<= .cse0 2) .cse2))) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-11-07 00:40:47,494 INFO L262 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#in~n| 2))) (and (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1)) (not .cse0)) (= fibo2_~n |fibo2_#in~n|) (or (not (<= |fibo2_#in~n| 4)) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= fibo2_~n 3)) (and (<= 4 |fibo2_#in~n|) (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3)) .cse0) (not (<= |fibo2_#in~n| 1)))) [2020-11-07 00:40:47,494 INFO L262 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#in~n| 3))) (and (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n)) (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (<= 5 |fibo2_#in~n|)) (and (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse0) (and .cse1 .cse0))) (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 2)) (and (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|)) (<= |fibo2_#in~n| 0) (not .cse1)))) [2020-11-07 00:40:47,495 INFO L262 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#in~n| 3))) (and (or (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (< 0 fibo2_~n)) (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (<= 5 |fibo2_#in~n|)) (and (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse0) (and .cse1 .cse0))) (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 2)) (and (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|)) (<= |fibo2_#in~n| 0) (not .cse1)))) [2020-11-07 00:40:47,495 INFO L269 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-11-07 00:40:47,495 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:40:47,495 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse1 (<= 1 |fibo1_#t~ret7|)) (.cse2 (<= |fibo1_#t~ret7| 1)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#t~ret7|) (<= 5 fibo1_~n) .cse0 (<= |fibo1_#t~ret7| 3)) (and .cse0 (<= 6 |fibo1_#in~n|)) (and .cse1 (<= |fibo1_#in~n| 2) .cse2 (<= 2 |fibo1_#in~n|) .cse0) (and (<= |fibo1_#in~n| 3) .cse1 .cse2 .cse0 (<= 3 |fibo1_#in~n|)) (and (<= 4 |fibo1_#in~n|) .cse0 (<= |fibo1_#in~n| 4)))) [2020-11-07 00:40:47,495 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:40:47,495 INFO L262 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse1 (<= 1 |fibo1_#t~ret7|)) (.cse2 (<= |fibo1_#t~ret7| 1)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#t~ret7|) (<= 5 fibo1_~n) .cse0 (<= |fibo1_#t~ret7| 3)) (and .cse0 (<= 6 |fibo1_#in~n|)) (and .cse1 (<= |fibo1_#in~n| 2) .cse2 (<= 2 |fibo1_#in~n|) .cse0) (and (<= |fibo1_#in~n| 3) .cse1 .cse2 .cse0 (<= 3 |fibo1_#in~n|)) (and (<= 4 |fibo1_#in~n|) .cse0 (<= |fibo1_#in~n| 4)))) [2020-11-07 00:40:47,495 INFO L262 CegarLoopResult]: At program point L12(lines 12 16) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-11-07 00:40:47,496 INFO L262 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (or (and (<= 3 |fibo1_#t~ret7|) (<= 5 .cse0) (<= |fibo1_#t~ret7| 3) (<= .cse0 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (= fibo1_~n |fibo1_#in~n|) (let ((.cse1 (<= 1 |fibo1_#t~ret7|)) (.cse2 (<= |fibo1_#t~ret7| 1))) (or (and .cse1 (<= 1 .cse0) (<= |fibo1_#in~n| 2) .cse2 (<= 2 |fibo1_#in~n|) (<= .cse0 1)) (not (<= |fibo1_#in~n| 3)) (and .cse1 (<= 2 .cse0) (<= .cse0 2) .cse2 (<= 3 |fibo1_#in~n|)))))) [2020-11-07 00:40:47,496 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:40:47,496 INFO L262 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (or (and (<= 3 |fibo1_#t~ret7|) (<= 5 .cse0) (<= |fibo1_#t~ret7| 3) (<= .cse0 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (= fibo1_~n |fibo1_#in~n|) (let ((.cse1 (<= 1 |fibo1_#t~ret7|)) (.cse2 (<= |fibo1_#t~ret7| 1))) (or (and .cse1 (<= 1 .cse0) (<= |fibo1_#in~n| 2) .cse2 (<= 2 |fibo1_#in~n|) (<= .cse0 1)) (not (<= |fibo1_#in~n| 3)) (and .cse1 (<= 2 .cse0) (<= .cse0 2) .cse2 (<= 3 |fibo1_#in~n|)))))) [2020-11-07 00:40:47,496 INFO L262 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (and (or (<= |fibo1_#in~n| 2) (not (<= |fibo1_#in~n| 3)) (and (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2))) (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= |fibo1_#in~n| 0) .cse0))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 00:40:47,496 INFO L262 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-11-07 00:40:47,497 INFO L262 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 3 |fibo1_#t~ret7|) (<= 5 .cse0) (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) (<= |fibo1_#t~ret7| 3) (<= .cse0 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (let ((.cse2 (<= 1 |fibo1_#t~ret7|)) (.cse3 (<= |fibo1_#t~ret7| 1)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 |fibo1_#in~n|) .cse1) (and (<= 2 |fibo1_#res|) .cse2 (<= 2 .cse0) (<= .cse0 2) .cse3 (<= |fibo1_#res| 2) .cse1 (<= 3 |fibo1_#in~n|)) (and .cse2 (<= 1 .cse0) (<= |fibo1_#in~n| 2) .cse3 .cse1 (<= |fibo1_#res| 1) (<= .cse0 1) (<= 1 |fibo1_#res|)))))) [2020-11-07 00:40:47,497 INFO L262 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse1 (<= |fibo1_#in~n| 2)) (.cse2 (<= 1 |fibo1_#t~ret7|)) (.cse3 (<= |fibo1_#t~ret7| 1)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 4 |fibo1_#in~n|) .cse0) .cse1 (and (<= 2 |fibo1_#res|) .cse2 .cse3 (<= |fibo1_#res| 2) .cse0)) (or (not .cse1) (and .cse2 .cse3 .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))) (or (and (<= 3 |fibo1_#t~ret7|) (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5) (<= |fibo1_#t~ret7| 3)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)))) [2020-11-07 00:40:47,497 INFO L262 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (and (or (<= |fibo1_#in~n| 2) (not (<= |fibo1_#in~n| 3)) (and (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2))) (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5)) (<= |fibo1_#in~n| 4) (<= 6 |fibo1_#in~n|)) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= |fibo1_#in~n| 0) .cse0))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 00:40:47,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:40:47 BoogieIcfgContainer [2020-11-07 00:40:47,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:40:47,530 INFO L168 Benchmark]: Toolchain (without parser) took 52025.54 ms. Allocated memory was 160.4 MB in the beginning and 483.4 MB in the end (delta: 323.0 MB). Free memory was 137.5 MB in the beginning and 235.4 MB in the end (delta: -97.9 MB). Peak memory consumption was 291.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:47,531 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 160.4 MB. Free memory was 134.9 MB in the beginning and 134.8 MB in the end (delta: 120.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:40:47,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.59 ms. Allocated memory is still 160.4 MB. Free memory was 136.9 MB in the beginning and 127.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:47,532 INFO L168 Benchmark]: Boogie Preprocessor took 37.83 ms. Allocated memory is still 160.4 MB. Free memory was 127.6 MB in the beginning and 126.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:47,532 INFO L168 Benchmark]: RCFGBuilder took 491.00 ms. Allocated memory is still 160.4 MB. Free memory was 126.2 MB in the beginning and 142.1 MB in the end (delta: -16.0 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:47,533 INFO L168 Benchmark]: TraceAbstraction took 51150.65 ms. Allocated memory was 160.4 MB in the beginning and 483.4 MB in the end (delta: 323.0 MB). Free memory was 141.6 MB in the beginning and 235.4 MB in the end (delta: -93.8 MB). Peak memory consumption was 295.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:47,536 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.23 ms. Allocated memory is still 160.4 MB. Free memory was 134.9 MB in the beginning and 134.8 MB in the end (delta: 120.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 326.59 ms. Allocated memory is still 160.4 MB. Free memory was 136.9 MB in the beginning and 127.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.83 ms. Allocated memory is still 160.4 MB. Free memory was 127.6 MB in the beginning and 126.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 491.00 ms. Allocated memory is still 160.4 MB. Free memory was 126.2 MB in the beginning and 142.1 MB in the end (delta: -16.0 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 51150.65 ms. Allocated memory was 160.4 MB in the beginning and 483.4 MB in the end (delta: 323.0 MB). Free memory was 141.6 MB in the beginning and 235.4 MB in the end (delta: -93.8 MB). Peak memory consumption was 295.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 37]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((\result <= 0 && 0 <= \result) || 0 < n) && (((n == \old(n) && 5 <= \old(n)) || ((3 <= \result && \result <= 3) && n == \old(n))) || (\old(n) <= 3 && n == \old(n)))) && (((((1 <= \result && \result <= 1) && \old(n) <= 2) || ((\result <= 2 && 3 <= n) && 2 <= \result)) || \old(n) <= 0) || !(\old(n) <= 3)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((((\old(n) <= 2 || !(\old(n) <= 3)) || (2 <= \result && \result <= 2)) && (((5 <= \result && \result <= 5) || \old(n) <= 4) || 6 <= \old(n))) && (((n == \old(n) && 3 <= \old(n)) || ((n == \old(n) && \result <= 1) && 1 <= \result)) || (\old(n) <= 0 && n == \old(n)))) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 26.1s, OverallIterations: 17, TraceHistogramMax: 17, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 897 SDtfs, 1535 SDslu, 2121 SDs, 0 SdLazy, 6625 SolverSat, 719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 753 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 134 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 2963 PreInvPairs, 5766 NumberOfFragments, 1283 HoareAnnotationTreeSize, 2963 FomulaSimplifications, 636825 FormulaSimplificationTreeSizeReduction, 9.7s HoareSimplificationTime, 57 FomulaSimplificationsInter, 90957 FormulaSimplificationTreeSizeReductionInter, 14.8s 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...