/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-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:40:01,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:40:01,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:40:01,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:40:01,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:40:01,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:40:01,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:40:01,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:40:01,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:40:01,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:40:01,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:40:01,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:40:01,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:40:01,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:40:01,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:40:01,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:40:01,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:40:01,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:40:01,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:40:01,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:40:01,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:40:01,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:40:01,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:40:01,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:40:01,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:40:01,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:40:01,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:40:01,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:40:01,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:40:01,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:40:01,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:40:01,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:40:01,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:40:01,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:40:01,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:40:01,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:40:01,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:40:01,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:40:01,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:40:01,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:40:01,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:40:01,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:40:01,932 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:40:01,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:40:01,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:40:01,937 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:40:01,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:40:01,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:40:01,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:40:01,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:40:01,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:40:01,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:40:01,939 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:40:01,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:40:01,940 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:40:01,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:40:01,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:40:01,941 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:40:01,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:40:01,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:40:01,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:40:01,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:40:01,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:40:01,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:40:01,942 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:40:02,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:40:02,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:40:02,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:40:02,461 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:40:02,462 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:40:02,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-11-07 00:40:02,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853597836/59a73b565cca4ee883073d3d1bc2140f/FLAG6cb2b26ab [2020-11-07 00:40:03,225 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:40:03,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-11-07 00:40:03,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853597836/59a73b565cca4ee883073d3d1bc2140f/FLAG6cb2b26ab [2020-11-07 00:40:03,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853597836/59a73b565cca4ee883073d3d1bc2140f [2020-11-07 00:40:03,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:40:03,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:40:03,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:40:03,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:40:03,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:40:03,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:03" (1/1) ... [2020-11-07 00:40:03,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d0fe900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03, skipping insertion in model container [2020-11-07 00:40:03,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:03" (1/1) ... [2020-11-07 00:40:03,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:40:03,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:40:03,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:40:03,800 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:40:03,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:40:03,836 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:40:03,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03 WrapperNode [2020-11-07 00:40:03,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:40:03,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:40:03,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:40:03,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:40:03,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03" (1/1) ... [2020-11-07 00:40:03,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03" (1/1) ... [2020-11-07 00:40:03,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03" (1/1) ... [2020-11-07 00:40:03,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03" (1/1) ... [2020-11-07 00:40:03,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03" (1/1) ... [2020-11-07 00:40:03,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03" (1/1) ... [2020-11-07 00:40:03,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03" (1/1) ... [2020-11-07 00:40:03,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:40:03,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:40:03,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:40:03,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:40:03,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:40:03,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:40:03,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:40:03,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:40:03,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 00:40:03,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 00:40:03,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:40:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:40:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:40:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:40:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:40:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:40:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 00:40:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 00:40:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:40:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:40:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:40:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:40:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:40:03,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:40:03,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:40:04,305 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:40:04,305 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:40:04,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:04 BoogieIcfgContainer [2020-11-07 00:40:04,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:40:04,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:40:04,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:40:04,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:40:04,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:40:03" (1/3) ... [2020-11-07 00:40:04,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d3cdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:04, skipping insertion in model container [2020-11-07 00:40:04,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:03" (2/3) ... [2020-11-07 00:40:04,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d3cdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:04, skipping insertion in model container [2020-11-07 00:40:04,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:04" (3/3) ... [2020-11-07 00:40:04,322 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2020-11-07 00:40:04,343 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:40:04,348 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:40:04,365 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:40:04,397 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:40:04,398 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:40:04,398 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:40:04,398 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:40:04,398 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:40:04,399 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:40:04,399 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:40:04,399 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:40:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 00:40:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:40:04,439 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:04,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:04,444 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 00:40:04,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:04,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1152399252] [2020-11-07 00:40:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:04,603 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:04,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:40:05,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1152399252] [2020-11-07 00:40:05,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:05,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:40:05,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645927258] [2020-11-07 00:40:05,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:40:05,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:05,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:40:05,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:40:05,098 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 00:40:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:05,621 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-11-07 00:40:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:05,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:40:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:05,634 INFO L225 Difference]: With dead ends: 74 [2020-11-07 00:40:05,635 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 00:40:05,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 00:40:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 00:40:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:40:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:40:05,701 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 00:40:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:05,702 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:40:05,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:40:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:40:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:40:05,705 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:05,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:05,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:40:05,706 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:05,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:05,707 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 00:40:05,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:05,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [89901266] [2020-11-07 00:40:05,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:05,711 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:05,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:05,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:40:05,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [89901266] [2020-11-07 00:40:05,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:05,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:40:05,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896524386] [2020-11-07 00:40:05,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:40:05,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:05,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:40:05,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:40:05,832 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 00:40:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:06,192 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 00:40:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:06,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:40:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:06,197 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:40:06,197 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:40:06,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:40:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:40:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:40:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:40:06,237 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 00:40:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:06,238 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:40:06,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:40:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:40:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:40:06,240 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:06,241 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:06,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:40:06,241 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 00:40:06,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:06,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [479565764] [2020-11-07 00:40:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:06,246 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:40:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:40:06,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [479565764] [2020-11-07 00:40:06,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:06,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:40:06,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391393014] [2020-11-07 00:40:06,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:40:06,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:40:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:40:06,406 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 00:40:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:06,730 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 00:40:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:06,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:40:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:06,733 INFO L225 Difference]: With dead ends: 92 [2020-11-07 00:40:06,733 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 00:40:06,736 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:40:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 00:40:06,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 00:40:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 00:40:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 00:40:06,760 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 00:40:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:06,760 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 00:40:06,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:40:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 00:40:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:40:06,762 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:06,762 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:06,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:40:06,763 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:06,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 00:40:06,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:06,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219467652] [2020-11-07 00:40:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:06,766 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:40:06,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219467652] [2020-11-07 00:40:06,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:06,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:40:06,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229625051] [2020-11-07 00:40:06,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:40:06,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:06,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:40:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:40:06,934 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 00:40:07,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:07,706 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 00:40:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:07,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 00:40:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:07,710 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:40:07,711 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:40:07,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:40:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:40:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 00:40:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 00:40:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 00:40:07,737 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 00:40:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:07,738 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 00:40:07,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:40:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 00:40:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 00:40:07,742 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:07,742 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:07,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:40:07,743 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 00:40:07,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:07,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1407409728] [2020-11-07 00:40:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:07,746 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:40:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 00:40:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:40:07,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1407409728] [2020-11-07 00:40:07,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:07,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:40:07,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724979122] [2020-11-07 00:40:07,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:40:07,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:07,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:40:07,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:40:07,903 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 00:40:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:08,261 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 00:40:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:08,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 00:40:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:08,266 INFO L225 Difference]: With dead ends: 140 [2020-11-07 00:40:08,266 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:40:08,272 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:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:40:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:40:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:40:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 00:40:08,301 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 00:40:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:08,301 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 00:40:08,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:40:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 00:40:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:40:08,305 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:08,306 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:08,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:40:08,306 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:08,307 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 00:40:08,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:08,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819578932] [2020-11-07 00:40:08,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:08,310 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:08,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:08,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:08,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:08,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:08,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:08,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:08,547 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:08,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819578932] [2020-11-07 00:40:08,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:08,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:40:08,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298142170] [2020-11-07 00:40:08,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:40:08,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:08,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:40:08,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:40:08,550 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 00:40:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:09,093 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 00:40:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:40:09,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:40:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:09,099 INFO L225 Difference]: With dead ends: 152 [2020-11-07 00:40:09,099 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 00:40:09,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:40:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 00:40:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 00:40:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 00:40:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 00:40:09,128 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 00:40:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:09,128 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 00:40:09,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:40:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 00:40:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:40:09,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:09,134 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:09,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:40:09,134 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:09,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:09,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 00:40:09,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:09,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [633783722] [2020-11-07 00:40:09,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:09,138 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:09,369 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:09,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [633783722] [2020-11-07 00:40:09,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:09,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:40:09,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022381628] [2020-11-07 00:40:09,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:40:09,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:09,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:40:09,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:09,372 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 00:40:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:10,092 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 00:40:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:40:10,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 00:40:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:10,095 INFO L225 Difference]: With dead ends: 128 [2020-11-07 00:40:10,096 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 00:40:10,096 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:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 00:40:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 00:40:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 00:40:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 00:40:10,135 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 00:40:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:10,136 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 00:40:10,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:40:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 00:40:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 00:40:10,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:10,140 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:10,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:40:10,141 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:10,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:10,141 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 00:40:10,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:10,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [276557726] [2020-11-07 00:40:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:10,144 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:10,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:10,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:10,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:10,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:10,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:10,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:10,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:10,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 00:40:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:10,423 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:10,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [276557726] [2020-11-07 00:40:10,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:10,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:40:10,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873915443] [2020-11-07 00:40:10,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:40:10,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:40:10,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:10,426 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 00:40:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:11,018 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 00:40:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:11,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 00:40:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:11,023 INFO L225 Difference]: With dead ends: 237 [2020-11-07 00:40:11,023 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 00:40:11,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:40:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 00:40:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 00:40:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:40:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 00:40:11,064 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 00:40:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:11,064 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 00:40:11,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:40:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 00:40:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 00:40:11,067 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:11,067 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:11,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:40:11,067 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:11,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 00:40:11,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:11,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [474189359] [2020-11-07 00:40:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:11,071 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:11,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:11,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:11,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:11,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:11,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:11,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:11,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:11,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:11,283 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:11,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [474189359] [2020-11-07 00:40:11,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:11,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:11,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845788922] [2020-11-07 00:40:11,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:11,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:11,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:11,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:11,286 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-11-07 00:40:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:11,967 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 00:40:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:11,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-07 00:40:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:11,973 INFO L225 Difference]: With dead ends: 267 [2020-11-07 00:40:11,974 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 00:40:11,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 00:40:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 00:40:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 00:40:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 00:40:12,034 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 00:40:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:12,035 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 00:40:12,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 00:40:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 00:40:12,041 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:12,041 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 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] [2020-11-07 00:40:12,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:40:12,042 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:12,043 INFO L82 PathProgramCache]: Analyzing trace with hash 546182201, now seen corresponding path program 2 times [2020-11-07 00:40:12,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:12,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902453908] [2020-11-07 00:40:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:12,047 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 00:40:12,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1902453908] [2020-11-07 00:40:12,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:12,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:12,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085416089] [2020-11-07 00:40:12,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:12,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:12,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:12,337 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-11-07 00:40:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:13,275 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-11-07 00:40:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:40:13,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2020-11-07 00:40:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:13,280 INFO L225 Difference]: With dead ends: 223 [2020-11-07 00:40:13,281 INFO L226 Difference]: Without dead ends: 216 [2020-11-07 00:40:13,282 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:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-07 00:40:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-11-07 00:40:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-07 00:40:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-11-07 00:40:13,331 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 97 [2020-11-07 00:40:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:13,332 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-11-07 00:40:13,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-11-07 00:40:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-07 00:40:13,336 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:13,336 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 00:40:13,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:40:13,337 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891877, now seen corresponding path program 2 times [2020-11-07 00:40:13,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:13,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1079589396] [2020-11-07 00:40:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:13,340 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 00:40:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-11-07 00:40:13,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1079589396] [2020-11-07 00:40:13,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:13,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:40:13,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821097978] [2020-11-07 00:40:13,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:40:13,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:40:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:40:13,598 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 11 states. [2020-11-07 00:40:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:14,579 INFO L93 Difference]: Finished difference Result 459 states and 784 transitions. [2020-11-07 00:40:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:40:14,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2020-11-07 00:40:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:14,586 INFO L225 Difference]: With dead ends: 459 [2020-11-07 00:40:14,586 INFO L226 Difference]: Without dead ends: 266 [2020-11-07 00:40:14,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 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:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-11-07 00:40:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 236. [2020-11-07 00:40:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-11-07 00:40:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 364 transitions. [2020-11-07 00:40:14,655 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 364 transitions. Word has length 115 [2020-11-07 00:40:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:14,656 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 364 transitions. [2020-11-07 00:40:14,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:40:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2020-11-07 00:40:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 00:40:14,661 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:14,661 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:14,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:40:14,662 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash -139933889, now seen corresponding path program 1 times [2020-11-07 00:40:14,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:14,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67915062] [2020-11-07 00:40:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:14,667 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:40:14,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:40:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:40:14,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:40:14,785 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:40:14,786 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:40:14,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:40:14,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:40:14 BoogieIcfgContainer [2020-11-07 00:40:14,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:40:14,826 INFO L168 Benchmark]: Toolchain (without parser) took 11237.98 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 127.7 MB in the beginning and 193.8 MB in the end (delta: -66.1 MB). Peak memory consumption was 46.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:14,827 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory is still 125.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:40:14,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.11 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 117.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:14,835 INFO L168 Benchmark]: Boogie Preprocessor took 37.23 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 116.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:14,836 INFO L168 Benchmark]: RCFGBuilder took 432.59 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 133.0 MB in the end (delta: -16.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:14,840 INFO L168 Benchmark]: TraceAbstraction took 10512.65 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 133.0 MB in the beginning and 193.8 MB in the end (delta: -60.7 MB). Peak memory consumption was 50.9 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:14,847 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.25 ms. Allocated memory is still 151.0 MB. Free memory is still 125.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 243.11 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 117.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.23 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 116.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 432.59 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 133.0 MB in the end (delta: -16.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10512.65 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 133.0 MB in the beginning and 193.8 MB in the end (delta: -60.7 MB). Peak memory consumption was 50.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 5; [L39] CALL, EXPR fibo1(x) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND TRUE n == 1 [L13] return 1; [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND TRUE n < 1 [L11] return 0; [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND FALSE !(n < 1) [L22] COND TRUE n == 1 [L23] return 1; [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND TRUE n == 1 [L23] return 1; [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND TRUE n < 1 [L21] return 0; [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND TRUE n == 1 [L23] return 1; [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND TRUE n < 1 [L21] return 0; [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND FALSE !(n < 1) [L12] COND TRUE n == 1 [L13] return 1; [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 5 [L41] CALL reach_error() [L4] __assert_fail("0", "fibo_2calls_5-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.3s, OverallIterations: 12, TraceHistogramMax: 8, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 560 SDtfs, 804 SDslu, 919 SDs, 0 SdLazy, 2508 SolverSat, 334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 3.4s 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 84 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...