/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:51:53,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:51:53,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:51:53,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:51:53,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:51:53,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:51:53,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:51:53,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:51:53,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:51:53,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:51:53,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:51:53,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:51:53,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:51:53,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:51:53,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:51:53,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:51:53,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:51:53,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:51:53,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:51:53,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:51:53,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:51:53,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:51:53,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:51:53,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:51:53,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:51:53,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:51:53,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:51:53,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:51:53,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:51:53,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:51:53,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:51:53,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:51:53,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:51:53,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:51:53,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:51:53,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:51:53,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:51:53,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:51:53,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:51:53,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:51:53,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:51:53,949 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:51:53,969 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:51:53,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:51:53,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:51:53,997 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:51:53,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:51:53,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:51:53,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:51:53,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:51:53,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:51:53,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:51:53,999 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:51:53,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:51:53,999 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:51:53,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:51:54,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:51:54,000 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:51:54,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:51:54,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:51:54,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:51:54,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:51:54,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:51:54,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:51:54,007 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:51:54,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:51:54,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:51:54,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:51:54,460 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:51:54,461 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:51:54,462 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-10-24 00:51:54,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9726eef57/e75c6ecf067e42f7aee2040aa14903ec/FLAG2f36aac35 [2020-10-24 00:51:55,084 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:51:55,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-10-24 00:51:55,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9726eef57/e75c6ecf067e42f7aee2040aa14903ec/FLAG2f36aac35 [2020-10-24 00:51:55,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9726eef57/e75c6ecf067e42f7aee2040aa14903ec [2020-10-24 00:51:55,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:51:55,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:51:55,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:51:55,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:51:55,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:51:55,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:51:55" (1/1) ... [2020-10-24 00:51:55,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68a6a153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55, skipping insertion in model container [2020-10-24 00:51:55,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:51:55" (1/1) ... [2020-10-24 00:51:55,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:51:55,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:51:55,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:51:55,730 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:51:55,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:51:55,764 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:51:55,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55 WrapperNode [2020-10-24 00:51:55,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:51:55,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:51:55,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:51:55,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:51:55,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55" (1/1) ... [2020-10-24 00:51:55,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55" (1/1) ... [2020-10-24 00:51:55,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55" (1/1) ... [2020-10-24 00:51:55,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55" (1/1) ... [2020-10-24 00:51:55,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55" (1/1) ... [2020-10-24 00:51:55,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55" (1/1) ... [2020-10-24 00:51:55,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55" (1/1) ... [2020-10-24 00:51:55,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:51:55,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:51:55,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:51:55,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:51:55,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:51:55,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:51:55,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:51:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:51:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-10-24 00:51:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-10-24 00:51:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:51:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:51:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:51:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:51:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:51:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:51:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-10-24 00:51:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-10-24 00:51:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:51:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:51:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:51:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:51:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:51:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:51:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:51:56,282 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:51:56,283 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:51:56,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:51:56 BoogieIcfgContainer [2020-10-24 00:51:56,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:51:56,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:51:56,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:51:56,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:51:56,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:51:55" (1/3) ... [2020-10-24 00:51:56,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64658608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:51:56, skipping insertion in model container [2020-10-24 00:51:56,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:55" (2/3) ... [2020-10-24 00:51:56,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64658608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:51:56, skipping insertion in model container [2020-10-24 00:51:56,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:51:56" (3/3) ... [2020-10-24 00:51:56,295 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2020-10-24 00:51:56,310 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:51:56,316 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:51:56,331 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:51:56,358 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:51:56,359 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:51:56,359 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:51:56,359 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:51:56,360 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:51:56,360 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:51:56,360 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:51:56,360 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:51:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-10-24 00:51:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:51:56,390 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:51:56,391 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-10-24 00:51:56,391 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:51:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:51:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-10-24 00:51:56,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:51:56,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [554747633] [2020-10-24 00:51:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:51:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:56,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:51:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:56,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:51:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:51:56,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [554747633] [2020-10-24 00:51:56,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:51:56,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:51:56,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868313010] [2020-10-24 00:51:56,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:51:56,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:51:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:51:56,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:51:56,786 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-10-24 00:51:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:51:57,234 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-10-24 00:51:57,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:51:57,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:51:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:51:57,247 INFO L225 Difference]: With dead ends: 71 [2020-10-24 00:51:57,247 INFO L226 Difference]: Without dead ends: 51 [2020-10-24 00:51:57,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:51:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-24 00:51:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-24 00:51:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:51:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:51:57,320 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-10-24 00:51:57,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:51:57,320 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:51:57,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:51:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:51:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:51:57,323 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:51:57,323 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-10-24 00:51:57,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:51:57,324 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:51:57,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:51:57,325 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-10-24 00:51:57,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:51:57,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1753783560] [2020-10-24 00:51:57,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:51:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:57,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:51:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:57,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:51:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:51:57,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1753783560] [2020-10-24 00:51:57,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:51:57,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:51:57,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286860706] [2020-10-24 00:51:57,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:51:57,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:51:57,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:51:57,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:51:57,465 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-10-24 00:51:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:51:57,755 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-10-24 00:51:57,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:51:57,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:51:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:51:57,758 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:51:57,759 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:51:57,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:51:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:51:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 00:51:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:51:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:51:57,781 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-10-24 00:51:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:51:57,781 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:51:57,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:51:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:51:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:51:57,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:51:57,784 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-10-24 00:51:57,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:51:57,784 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:51:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:51:57,785 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-10-24 00:51:57,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:51:57,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [402332082] [2020-10-24 00:51:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:51:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:57,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:51:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:57,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:51:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:57,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:51:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:57,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:51:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 00:51:57,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [402332082] [2020-10-24 00:51:57,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:51:57,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:51:57,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992270182] [2020-10-24 00:51:57,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:51:57,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:51:57,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:51:57,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:51:57,976 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-10-24 00:51:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:51:58,311 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-10-24 00:51:58,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:51:58,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-10-24 00:51:58,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:51:58,314 INFO L225 Difference]: With dead ends: 92 [2020-10-24 00:51:58,314 INFO L226 Difference]: Without dead ends: 55 [2020-10-24 00:51:58,316 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-10-24 00:51:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-24 00:51:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-10-24 00:51:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-24 00:51:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-10-24 00:51:58,343 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-10-24 00:51:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:51:58,343 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-10-24 00:51:58,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:51:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-10-24 00:51:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:51:58,349 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:51:58,350 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-10-24 00:51:58,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:51:58,350 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:51:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:51:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-10-24 00:51:58,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:51:58,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101645643] [2020-10-24 00:51:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:51:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:58,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:51:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:58,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:51:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:58,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:51:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:58,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:51:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 00:51:58,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101645643] [2020-10-24 00:51:58,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:51:58,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:51:58,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304406586] [2020-10-24 00:51:58,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:51:58,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:51:58,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:51:58,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:51:58,568 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-10-24 00:51:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:51:59,159 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-10-24 00:51:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:51:59,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-10-24 00:51:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:51:59,163 INFO L225 Difference]: With dead ends: 84 [2020-10-24 00:51:59,163 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:51:59,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:51:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:51:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-10-24 00:51:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 00:51:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-10-24 00:51:59,187 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-10-24 00:51:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:51:59,188 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-10-24 00:51:59,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:51:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-10-24 00:51:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 00:51:59,190 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:51:59,191 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-10-24 00:51:59,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:51:59,191 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:51:59,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:51:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-10-24 00:51:59,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:51:59,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120696250] [2020-10-24 00:51:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:51:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:51:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:51:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:51:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:51:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:51:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 00:51:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-24 00:51:59,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120696250] [2020-10-24 00:51:59,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:51:59,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:51:59,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35928101] [2020-10-24 00:51:59,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:51:59,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:51:59,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:51:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:51:59,364 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-10-24 00:51:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:51:59,744 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-10-24 00:51:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:51:59,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-10-24 00:51:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:51:59,751 INFO L225 Difference]: With dead ends: 140 [2020-10-24 00:51:59,751 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 00:51:59,756 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-10-24 00:51:59,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 00:51:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-24 00:51:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 00:51:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-10-24 00:51:59,781 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-10-24 00:51:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:51:59,782 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-10-24 00:51:59,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:51:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-10-24 00:51:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:51:59,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:51:59,784 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-10-24 00:51:59,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:51:59,785 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:51:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:51:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-10-24 00:51:59,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:51:59,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1341898807] [2020-10-24 00:51:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:51:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:51:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:51:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:51:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:51:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:51:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:51:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:51:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-24 00:51:59,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1341898807] [2020-10-24 00:51:59,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:51:59,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:51:59,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277464198] [2020-10-24 00:51:59,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:51:59,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:51:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:51:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:51:59,962 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-10-24 00:52:00,395 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-10-24 00:52:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:00,665 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-10-24 00:52:00,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:52:00,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-10-24 00:52:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:00,668 INFO L225 Difference]: With dead ends: 152 [2020-10-24 00:52:00,668 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:52:00,670 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-10-24 00:52:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:52:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-10-24 00:52:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-24 00:52:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-10-24 00:52:00,697 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-10-24 00:52:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:00,697 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-10-24 00:52:00,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:52:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-10-24 00:52:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:52:00,700 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:00,700 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-10-24 00:52:00,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:52:00,700 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-10-24 00:52:00,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:00,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684677816] [2020-10-24 00:52:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:00,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:00,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:00,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:00,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:00,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:00,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-24 00:52:00,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684677816] [2020-10-24 00:52:00,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:00,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:52:00,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999621964] [2020-10-24 00:52:00,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:52:00,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:00,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:52:00,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:00,872 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-10-24 00:52:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:01,651 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-10-24 00:52:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:52:01,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-10-24 00:52:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:01,657 INFO L225 Difference]: With dead ends: 128 [2020-10-24 00:52:01,657 INFO L226 Difference]: Without dead ends: 121 [2020-10-24 00:52:01,659 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-10-24 00:52:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-24 00:52:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-10-24 00:52:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-24 00:52:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-10-24 00:52:01,714 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-10-24 00:52:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:01,715 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-10-24 00:52:01,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:52:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-10-24 00:52:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 00:52:01,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:01,719 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-10-24 00:52:01,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:52:01,720 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-10-24 00:52:01,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:01,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186766168] [2020-10-24 00:52:01,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:01,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:01,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:01,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:01,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:01,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:01,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:01,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:01,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 00:52:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-24 00:52:01,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [186766168] [2020-10-24 00:52:01,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:01,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:52:01,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373457886] [2020-10-24 00:52:01,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:52:01,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:52:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:01,990 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-10-24 00:52:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:02,668 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-10-24 00:52:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:02,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-10-24 00:52:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:02,676 INFO L225 Difference]: With dead ends: 237 [2020-10-24 00:52:02,677 INFO L226 Difference]: Without dead ends: 136 [2020-10-24 00:52:02,679 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-10-24 00:52:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-24 00:52:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-10-24 00:52:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-24 00:52:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-10-24 00:52:02,739 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-10-24 00:52:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:02,740 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-10-24 00:52:02,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:52:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-10-24 00:52:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 00:52:02,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:02,743 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-10-24 00:52:02,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:52:02,746 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-10-24 00:52:02,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:02,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2111292079] [2020-10-24 00:52:02,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:02,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:02,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:02,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:02,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:02,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:02,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:02,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:03,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-24 00:52:03,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2111292079] [2020-10-24 00:52:03,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:03,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:52:03,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753453595] [2020-10-24 00:52:03,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:52:03,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:52:03,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:52:03,055 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 11 states. [2020-10-24 00:52:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:03,982 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-10-24 00:52:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:52:03,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-10-24 00:52:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:03,989 INFO L225 Difference]: With dead ends: 267 [2020-10-24 00:52:03,989 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 00:52:03,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:52:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 00:52:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-10-24 00:52:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-24 00:52:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-10-24 00:52:04,025 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-10-24 00:52:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:04,026 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-10-24 00:52:04,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:52:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-10-24 00:52:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 00:52:04,028 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:04,029 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-10-24 00:52:04,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:52:04,029 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash 546182201, now seen corresponding path program 2 times [2020-10-24 00:52:04,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:04,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [464298987] [2020-10-24 00:52:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 43 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-24 00:52:04,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [464298987] [2020-10-24 00:52:04,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:04,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:52:04,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891873933] [2020-10-24 00:52:04,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:52:04,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:52:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:52:04,309 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 13 states. [2020-10-24 00:52:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:05,859 INFO L93 Difference]: Finished difference Result 278 states and 422 transitions. [2020-10-24 00:52:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:52:05,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-10-24 00:52:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:05,863 INFO L225 Difference]: With dead ends: 278 [2020-10-24 00:52:05,863 INFO L226 Difference]: Without dead ends: 147 [2020-10-24 00:52:05,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:52:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-24 00:52:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2020-10-24 00:52:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-24 00:52:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2020-10-24 00:52:05,895 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 97 [2020-10-24 00:52:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:05,896 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2020-10-24 00:52:05,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:52:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2020-10-24 00:52:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-24 00:52:05,897 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:05,898 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:05,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:52:05,898 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:05,899 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-10-24 00:52:05,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:05,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248314155] [2020-10-24 00:52:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:05,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:05,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:06,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:06,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:06,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:06,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:06,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:06,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:06,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:06,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-10-24 00:52:06,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248314155] [2020-10-24 00:52:06,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:06,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:52:06,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99084483] [2020-10-24 00:52:06,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:52:06,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:06,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:52:06,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:52:06,450 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand 18 states. [2020-10-24 00:52:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:08,721 INFO L93 Difference]: Finished difference Result 184 states and 230 transitions. [2020-10-24 00:52:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:52:08,722 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2020-10-24 00:52:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:08,725 INFO L225 Difference]: With dead ends: 184 [2020-10-24 00:52:08,725 INFO L226 Difference]: Without dead ends: 177 [2020-10-24 00:52:08,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 00:52:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-24 00:52:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 148. [2020-10-24 00:52:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-24 00:52:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2020-10-24 00:52:08,762 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 96 [2020-10-24 00:52:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:08,762 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2020-10-24 00:52:08,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:52:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2020-10-24 00:52:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 00:52:08,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:08,765 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:08,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:52:08,765 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1477616796, now seen corresponding path program 2 times [2020-10-24 00:52:08,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:08,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [852058501] [2020-10-24 00:52:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:52:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-10-24 00:52:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-24 00:52:08,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [852058501] [2020-10-24 00:52:08,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:08,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:52:08,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673811788] [2020-10-24 00:52:08,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:52:08,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:08,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:52:08,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:52:08,936 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand 8 states. [2020-10-24 00:52:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:09,519 INFO L93 Difference]: Finished difference Result 274 states and 371 transitions. [2020-10-24 00:52:09,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:09,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2020-10-24 00:52:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:09,524 INFO L225 Difference]: With dead ends: 274 [2020-10-24 00:52:09,524 INFO L226 Difference]: Without dead ends: 142 [2020-10-24 00:52:09,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:52:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-24 00:52:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-10-24 00:52:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-24 00:52:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2020-10-24 00:52:09,576 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 97 [2020-10-24 00:52:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:09,577 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2020-10-24 00:52:09,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:52:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2020-10-24 00:52:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-24 00:52:09,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:09,582 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:09,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:52:09,582 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash -375801608, now seen corresponding path program 2 times [2020-10-24 00:52:09,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:09,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075004723] [2020-10-24 00:52:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 00:52:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 67 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-10-24 00:52:09,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075004723] [2020-10-24 00:52:09,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:09,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:52:09,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688854302] [2020-10-24 00:52:09,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:52:09,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:09,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:52:09,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:52:09,870 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand 11 states. [2020-10-24 00:52:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:10,680 INFO L93 Difference]: Finished difference Result 259 states and 334 transitions. [2020-10-24 00:52:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:52:10,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2020-10-24 00:52:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:10,684 INFO L225 Difference]: With dead ends: 259 [2020-10-24 00:52:10,684 INFO L226 Difference]: Without dead ends: 134 [2020-10-24 00:52:10,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:52:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-24 00:52:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-10-24 00:52:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-24 00:52:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2020-10-24 00:52:10,719 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 132 [2020-10-24 00:52:10,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:10,720 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2020-10-24 00:52:10,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:52:10,720 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2020-10-24 00:52:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-10-24 00:52:10,722 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:10,723 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-24 00:52:10,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:52:10,723 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash -443839068, now seen corresponding path program 3 times [2020-10-24 00:52:10,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:10,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [64465923] [2020-10-24 00:52:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:10,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:10,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:10,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:10,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:10,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:10,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:10,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:10,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:10,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:11,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:11,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:11,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-10-24 00:52:11,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [64465923] [2020-10-24 00:52:11,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:11,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:52:11,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976626547] [2020-10-24 00:52:11,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:52:11,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:11,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:52:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:52:11,075 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand 13 states. [2020-10-24 00:52:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:12,593 INFO L93 Difference]: Finished difference Result 251 states and 321 transitions. [2020-10-24 00:52:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:52:12,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2020-10-24 00:52:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:12,598 INFO L225 Difference]: With dead ends: 251 [2020-10-24 00:52:12,598 INFO L226 Difference]: Without dead ends: 113 [2020-10-24 00:52:12,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:52:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-24 00:52:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2020-10-24 00:52:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-24 00:52:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2020-10-24 00:52:12,645 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 114 [2020-10-24 00:52:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:12,646 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2020-10-24 00:52:12,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:52:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2020-10-24 00:52:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:52:12,650 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:12,650 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-10-24 00:52:12,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:52:12,650 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:12,651 INFO L82 PathProgramCache]: Analyzing trace with hash -139933889, now seen corresponding path program 3 times [2020-10-24 00:52:12,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:12,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884556556] [2020-10-24 00:52:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:12,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:52:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:13,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:13,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:13,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:13,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-10-24 00:52:13,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884556556] [2020-10-24 00:52:13,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:13,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:52:13,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267324480] [2020-10-24 00:52:13,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:52:13,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:13,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:52:13,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:52:13,074 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand 11 states. [2020-10-24 00:52:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:13,904 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2020-10-24 00:52:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:52:13,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 149 [2020-10-24 00:52:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:13,906 INFO L225 Difference]: With dead ends: 112 [2020-10-24 00:52:13,906 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:52:13,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:52:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:52:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:52:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:52:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:52:13,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2020-10-24 00:52:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:13,909 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:52:13,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:52:13,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:52:13,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:52:13,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:52:13,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:52:14,561 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2020-10-24 00:52:14,840 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2020-10-24 00:52:15,179 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2020-10-24 00:52:15,426 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2020-10-24 00:52:16,751 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2020-10-24 00:52:17,068 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2020-10-24 00:52:18,294 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2020-10-24 00:52:19,092 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 8 [2020-10-24 00:52:19,276 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 6 [2020-10-24 00:52:19,634 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 23 [2020-10-24 00:52:20,100 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2020-10-24 00:52:20,436 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 19 [2020-10-24 00:52:20,694 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 23 [2020-10-24 00:52:20,979 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 28 [2020-10-24 00:52:21,274 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 28 [2020-10-24 00:52:21,379 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 6 [2020-10-24 00:52:21,687 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 16 [2020-10-24 00:52:21,950 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 19 [2020-10-24 00:52:22,550 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 27 [2020-10-24 00:52:22,864 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 19 [2020-10-24 00:52:23,758 WARN L193 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 34 [2020-10-24 00:52:24,145 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 16 [2020-10-24 00:52:24,689 WARN L193 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 27 [2020-10-24 00:52:24,991 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2020-10-24 00:52:25,249 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 18 [2020-10-24 00:52:25,421 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 7 [2020-10-24 00:52:26,264 WARN L193 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 34 [2020-10-24 00:52:26,426 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,426 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,427 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,427 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,427 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,427 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,427 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:52:26,427 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:52:26,428 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,428 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:52:26,428 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,429 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,429 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-24 00:52:26,429 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:52:26,429 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:52:26,429 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:52:26,429 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:52:26,430 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:52:26,430 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-10-24 00:52:26,430 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (<= 4 main_~x~0) [2020-10-24 00:52:26,430 INFO L270 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (<= 4 main_~x~0) [2020-10-24 00:52:26,430 INFO L270 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-10-24 00:52:26,430 INFO L270 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~result~0 3) (<= main_~x~0 4) (< 2 main_~result~0)) [2020-10-24 00:52:26,430 INFO L270 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-10-24 00:52:26,430 INFO L270 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~x~0 4)) [2020-10-24 00:52:26,431 INFO L270 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= |main_#t~ret11| 3) (<= main_~x~0 4) (<= 3 |main_#t~ret11|)) [2020-10-24 00:52:26,431 INFO L270 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 4 main_~x~0) [2020-10-24 00:52:26,431 INFO L270 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= |main_#t~ret11| 3) (<= main_~x~0 4) (<= 3 |main_#t~ret11|)) [2020-10-24 00:52:26,431 INFO L270 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~result~0 3) (<= |main_#t~ret11| 3) (<= main_~x~0 4) (< 2 main_~result~0) (<= 3 |main_#t~ret11|)) [2020-10-24 00:52:26,431 INFO L277 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-10-24 00:52:26,431 INFO L270 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-10-24 00:52:26,432 INFO L270 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (or (and (<= |fibo2_#t~ret9| 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= |fibo2_#in~n| 2)) (not (<= |fibo2_#in~n| 3)))) [2020-10-24 00:52:26,432 INFO L270 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1)) [2020-10-24 00:52:26,432 INFO L270 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (or (and (<= |fibo2_#t~ret9| 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= |fibo2_#in~n| 2)) (not (<= |fibo2_#in~n| 3)))) [2020-10-24 00:52:26,432 INFO L270 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|)) [2020-10-24 00:52:26,432 INFO L270 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 4 |fibo2_#in~n|) .cse0) (let ((.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (and (<= |fibo2_#t~ret9| 1) .cse0 (<= .cse1 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= 1 .cse1) (<= |fibo2_#in~n| 2))))) [2020-10-24 00:52:26,433 INFO L270 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-10-24 00:52:26,433 INFO L270 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 4 |fibo2_#in~n|) .cse0) (let ((.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (and (<= |fibo2_#t~ret9| 1) .cse0 (<= .cse1 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= 1 .cse1) (<= |fibo2_#in~n| 2))))) [2020-10-24 00:52:26,433 INFO L270 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-10-24 00:52:26,433 INFO L270 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 4 |fibo2_#in~n|) .cse0) (let ((.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#t~ret9| 1) .cse0 (<= .cse1 1) (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= 1 .cse1) (<= |fibo2_#in~n| 2))))) [2020-10-24 00:52:26,433 INFO L270 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#t~ret9| 1) .cse0 (< 1 fibo2_~n) (<= 1 |fibo2_#t~ret9|) (<= |fibo2_#in~n| 2)) (and (<= 4 |fibo2_#in~n|) .cse0))) [2020-10-24 00:52:26,433 INFO L270 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= 4 |fibo2_#in~n|) .cse0) (<= |fibo2_#in~n| 2)) (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)) (not (<= |fibo2_#in~n| 3))) (or (<= 1 |fibo2_#in~n|) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))))) [2020-10-24 00:52:26,434 INFO L270 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= 4 |fibo2_#in~n|) .cse0) (<= |fibo2_#in~n| 2)) (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)) (not (<= |fibo2_#in~n| 3))) (or (<= 1 |fibo2_#in~n|) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))))) [2020-10-24 00:52:26,434 INFO L277 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-10-24 00:52:26,434 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (not (<= |fibo1_#in~n| 2))) [2020-10-24 00:52:26,434 INFO L270 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) .cse0 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and (<= |fibo1_#in~n| 3) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-10-24 00:52:26,434 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 1 |fibo1_#in~n|) (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:52:26,434 INFO L270 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) .cse0 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and (<= |fibo1_#in~n| 3) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-10-24 00:52:26,435 INFO L270 CegarLoopResult]: At program point L12(lines 12 16) the Hoare annotation is: (and (<= 1 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:52:26,435 INFO L270 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (or (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= .cse0 3) (<= 4 fibo1_~n) (<= 3 .cse0) (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|))) (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) [2020-10-24 00:52:26,435 INFO L270 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-10-24 00:52:26,435 INFO L270 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (or (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= .cse0 3) (<= 4 fibo1_~n) (<= 3 .cse0) (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|))) (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) [2020-10-24 00:52:26,435 INFO L270 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 2)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (and (or (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (<= |fibo1_#in~n| 0) (and .cse1 (or (<= |fibo1_#in~n| 3) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))) (<= 3 |fibo1_#in~n|)) (and (<= 5 |fibo1_#in~n|) .cse1)) (or (and (<= 0 |fibo1_#res|) .cse0 (<= |fibo1_#res| 0) .cse1) (not .cse0) (and .cse0 (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) .cse1)))) [2020-10-24 00:52:26,435 INFO L270 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-10-24 00:52:26,436 INFO L270 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (and (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (or (and (<= |fibo1_#in~n| 3) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1)) (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= |fibo1_#res| 3) (<= .cse0 3) (<= 3 |fibo1_#res|) (<= 4 fibo1_~n) (<= 3 .cse0) (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)))) .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) (not (<= |fibo1_#in~n| 2))) [2020-10-24 00:52:26,436 INFO L270 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|)) (<= |fibo1_#in~n| 3)) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-10-24 00:52:26,436 INFO L270 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 2)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (and (or (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (<= |fibo1_#in~n| 0) (and .cse1 (or (<= |fibo1_#in~n| 3) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|))) (<= 3 |fibo1_#in~n|)) (and (<= 5 |fibo1_#in~n|) .cse1)) (or (and (<= 0 |fibo1_#res|) .cse0 (<= |fibo1_#res| 0) .cse1) (not .cse0) (and .cse0 (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) .cse1)))) [2020-10-24 00:52:26,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:52:26 BoogieIcfgContainer [2020-10-24 00:52:26,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:52:26,458 INFO L168 Benchmark]: Toolchain (without parser) took 31021.09 ms. Allocated memory was 166.7 MB in the beginning and 426.8 MB in the end (delta: 260.0 MB). Free memory was 127.8 MB in the beginning and 177.6 MB in the end (delta: -49.8 MB). Peak memory consumption was 236.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:26,458 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 166.7 MB. Free memory is still 144.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:52:26,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.76 ms. Allocated memory is still 166.7 MB. Free memory was 127.1 MB in the beginning and 147.5 MB in the end (delta: -20.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:26,459 INFO L168 Benchmark]: Boogie Preprocessor took 35.46 ms. Allocated memory is still 166.7 MB. Free memory was 147.5 MB in the beginning and 146.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:26,460 INFO L168 Benchmark]: RCFGBuilder took 481.83 ms. Allocated memory is still 166.7 MB. Free memory was 146.1 MB in the beginning and 137.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:26,461 INFO L168 Benchmark]: TraceAbstraction took 30169.01 ms. Allocated memory was 166.7 MB in the beginning and 426.8 MB in the end (delta: 260.0 MB). Free memory was 136.5 MB in the beginning and 177.6 MB in the end (delta: -41.1 MB). Peak memory consumption was 245.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:26,464 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 166.7 MB. Free memory is still 144.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 316.76 ms. Allocated memory is still 166.7 MB. Free memory was 127.1 MB in the beginning and 147.5 MB in the end (delta: -20.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.46 ms. Allocated memory is still 166.7 MB. Free memory was 147.5 MB in the beginning and 146.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 481.83 ms. Allocated memory is still 166.7 MB. Free memory was 146.1 MB in the beginning and 137.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 30169.01 ms. Allocated memory was 166.7 MB in the beginning and 426.8 MB in the end (delta: 260.0 MB). Free memory was 136.5 MB in the beginning and 177.6 MB in the end (delta: -41.1 MB). Peak memory consumption was 245.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 37]: Procedure Contract for main Derived contract for procedure main: 4 <= x - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((4 <= \old(n) && n == \old(n)) || \old(n) <= 2) && ((((1 <= \result && \result <= 1) && n == \old(n)) || (n == \old(n) && \old(n) <= 0)) || !(\old(n) <= 3))) && (1 <= \old(n) || (\result <= 0 && 0 <= \result)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((\old(n) <= 2 && \result <= 1) && 1 <= \result) || \old(n) <= 0) || ((n == \old(n) && (\old(n) <= 3 || (\result <= 3 && 3 <= \result))) && 3 <= \old(n))) || (5 <= \old(n) && n == \old(n))) && (((((0 <= \result && \old(n) <= 2) && \result <= 0) && n == \old(n)) || !(\old(n) <= 2)) || (((\old(n) <= 2 && \old(n) <= 1) && 0 < n) && n == \old(n))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 17.5s, OverallIterations: 15, TraceHistogramMax: 8, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 766 SDtfs, 1210 SDslu, 1604 SDs, 0 SdLazy, 4657 SolverSat, 520 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred 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.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 102 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 2017 PreInvPairs, 3397 NumberOfFragments, 862 HoareAnnotationTreeSize, 2017 FomulaSimplifications, 259051 FormulaSimplificationTreeSizeReduction, 5.0s HoareSimplificationTime, 57 FomulaSimplificationsInter, 37842 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1143 ConstructedInterpolants, 0 QuantifiedInterpolants, 231835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 742/1089 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...