/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_6-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:04:50,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:04:50,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:04:50,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:04:50,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:04:50,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:04:50,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:04:50,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:04:50,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:04:50,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:04:50,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:04:50,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:04:50,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:04:50,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:04:50,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:04:50,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:04:50,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:04:50,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:04:50,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:04:50,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:04:50,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:04:50,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:04:50,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:04:50,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:04:50,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:04:50,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:04:50,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:04:50,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:04:50,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:04:50,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:04:50,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:04:50,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:04:50,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:04:50,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:04:50,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:04:50,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:04:50,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:04:50,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:04:50,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:04:50,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:04:50,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:04:50,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:04:50,874 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:04:50,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:04:50,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:04:50,880 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:04:50,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:04:50,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:04:50,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:04:50,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:04:50,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:04:50,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:04:50,882 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:04:50,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:04:50,883 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:04:50,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:04:50,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:04:50,884 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:04:50,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:04:50,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:04:50,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:04:50,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:04:50,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:04:50,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:04:50,885 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-11-07 05:04:51,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:04:51,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:04:51,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:04:51,360 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:04:51,361 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:04:51,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-11-07 05:04:51,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33f65d89/3a72130230a64f8193ccfef29f203921/FLAGcbc0d3046 [2020-11-07 05:04:52,212 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:04:52,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-11-07 05:04:52,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33f65d89/3a72130230a64f8193ccfef29f203921/FLAGcbc0d3046 [2020-11-07 05:04:52,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33f65d89/3a72130230a64f8193ccfef29f203921 [2020-11-07 05:04:52,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:04:52,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:04:52,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:04:52,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:04:52,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:04:52,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:52" (1/1) ... [2020-11-07 05:04:52,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff699de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52, skipping insertion in model container [2020-11-07 05:04:52,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:52" (1/1) ... [2020-11-07 05:04:52,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:04:52,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:04:52,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:04:52,831 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:04:52,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:04:52,864 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:04:52,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52 WrapperNode [2020-11-07 05:04:52,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:04:52,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:04:52,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:04:52,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:04:52,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52" (1/1) ... [2020-11-07 05:04:52,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52" (1/1) ... [2020-11-07 05:04:52,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52" (1/1) ... [2020-11-07 05:04:52,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52" (1/1) ... [2020-11-07 05:04:52,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52" (1/1) ... [2020-11-07 05:04:52,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52" (1/1) ... [2020-11-07 05:04:52,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52" (1/1) ... [2020-11-07 05:04:52,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:04:52,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:04:52,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:04:52,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:04:52,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:04:52,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:04:52,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:04:52,990 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:04:52,990 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 05:04:52,990 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 05:04:52,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:04:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:04:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:04:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:04:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:04:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:04:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 05:04:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 05:04:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:04:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:04:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:04:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:04:52,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:04:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:04:52,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:04:53,436 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:04:53,439 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:04:53,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:53 BoogieIcfgContainer [2020-11-07 05:04:53,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:04:53,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:04:53,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:04:53,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:04:53,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:04:52" (1/3) ... [2020-11-07 05:04:53,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5ef036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:53, skipping insertion in model container [2020-11-07 05:04:53,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:52" (2/3) ... [2020-11-07 05:04:53,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5ef036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:53, skipping insertion in model container [2020-11-07 05:04:53,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:53" (3/3) ... [2020-11-07 05:04:53,460 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2020-11-07 05:04:53,478 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:04:53,482 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:04:53,497 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:04:53,527 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:04:53,527 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:04:53,527 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:04:53,527 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:04:53,528 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:04:53,528 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:04:53,528 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:04:53,528 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:04:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 05:04:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:04:53,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:53,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:53,561 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 05:04:53,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:53,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1757663164] [2020-11-07 05:04:53,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,035 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-11-07 05:04:54,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:04:54,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1757663164] [2020-11-07 05:04:54,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:04:54,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:04:54,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641681612] [2020-11-07 05:04:54,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:04:54,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:54,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:04:54,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:04:54,160 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 05:04:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:54,632 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-11-07 05:04:54,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:04:54,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:04:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:54,646 INFO L225 Difference]: With dead ends: 71 [2020-11-07 05:04:54,646 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 05:04:54,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:54,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 05:04:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 05:04:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:04:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:04:54,728 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 05:04:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:54,729 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:04:54,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:04:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:04:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 05:04:54,732 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:54,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:54,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:04:54,732 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:54,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:54,733 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 05:04:54,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:54,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853719269] [2020-11-07 05:04:54,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:04:54,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853719269] [2020-11-07 05:04:54,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:04:54,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:04:54,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570905636] [2020-11-07 05:04:54,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:04:54,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:04:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:04:54,890 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 05:04:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:55,181 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 05:04:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:04:55,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 05:04:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:55,184 INFO L225 Difference]: With dead ends: 60 [2020-11-07 05:04:55,184 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 05:04:55,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 05:04:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 05:04:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:04:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:04:55,207 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 05:04:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:55,207 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:04:55,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:04:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:04:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 05:04:55,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:55,212 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:55,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:04:55,215 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:55,215 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 05:04:55,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:55,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1171550381] [2020-11-07 05:04:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:04:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:04:55,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1171550381] [2020-11-07 05:04:55,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:55,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:04:55,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002440900] [2020-11-07 05:04:55,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:04:55,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:04:55,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:04:55,392 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 05:04:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:55,776 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 05:04:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:55,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 05:04:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:55,779 INFO L225 Difference]: With dead ends: 92 [2020-11-07 05:04:55,780 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 05:04:55,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 05:04:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 05:04:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 05:04:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 05:04:55,806 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 05:04:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:55,807 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 05:04:55,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:04:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 05:04:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:04:55,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:55,813 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:55,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:04:55,813 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:55,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 05:04:55,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:55,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [694821304] [2020-11-07 05:04:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:04:56,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [694821304] [2020-11-07 05:04:56,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:56,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:04:56,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245599072] [2020-11-07 05:04:56,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:04:56,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:56,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:04:56,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:04:56,048 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 05:04:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:56,765 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 05:04:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:04:56,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 05:04:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:56,769 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:04:56,769 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:04:56,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:04:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:04:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 05:04:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 05:04:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 05:04:56,794 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 05:04:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:56,794 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 05:04:56,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:04:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 05:04:56,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 05:04:56,797 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:56,797 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:56,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:04:56,798 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:56,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:56,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 05:04:56,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:56,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [767072833] [2020-11-07 05:04:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:04:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 05:04:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 05:04:56,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [767072833] [2020-11-07 05:04:56,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:56,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:04:56,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463889972] [2020-11-07 05:04:56,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:04:56,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:04:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:04:56,946 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 05:04:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:57,391 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 05:04:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:57,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 05:04:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:57,394 INFO L225 Difference]: With dead ends: 140 [2020-11-07 05:04:57,394 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 05:04:57,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 05:04:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 05:04:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 05:04:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 05:04:57,421 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 05:04:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:57,422 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 05:04:57,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:04:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 05:04:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:04:57,425 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:57,425 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:57,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:04:57,425 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 05:04:57,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:57,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1496793647] [2020-11-07 05:04:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:04:57,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1496793647] [2020-11-07 05:04:57,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:57,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:04:57,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389117124] [2020-11-07 05:04:57,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:04:57,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:57,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:04:57,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:04:57,605 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 05:04:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:58,182 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 05:04:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:04:58,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 05:04:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:58,187 INFO L225 Difference]: With dead ends: 152 [2020-11-07 05:04:58,187 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 05:04:58,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:04:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 05:04:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 05:04:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 05:04:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 05:04:58,219 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 05:04:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:58,220 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 05:04:58,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:04:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 05:04:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:04:58,223 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:58,223 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:58,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:04:58,224 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:58,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 05:04:58,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:58,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1811911254] [2020-11-07 05:04:58,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:58,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:58,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:58,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:58,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:58,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:58,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 05:04:58,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1811911254] [2020-11-07 05:04:58,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:58,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:04:58,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113463349] [2020-11-07 05:04:58,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:04:58,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:04:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:58,416 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 05:04:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:59,222 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 05:04:59,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:04:59,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 05:04:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:59,231 INFO L225 Difference]: With dead ends: 128 [2020-11-07 05:04:59,231 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 05:04:59,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:04:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 05:04:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 05:04:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 05:04:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 05:04:59,286 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 05:04:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:59,287 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 05:04:59,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:04:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 05:04:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 05:04:59,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:59,290 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:59,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:04:59,291 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 05:04:59,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:59,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1539217600] [2020-11-07 05:04:59,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 05:04:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:04:59,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1539217600] [2020-11-07 05:04:59,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:59,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:04:59,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458620206] [2020-11-07 05:04:59,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:04:59,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:59,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:04:59,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:59,487 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 05:05:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:00,149 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 05:05:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:05:00,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 05:05:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:00,156 INFO L225 Difference]: With dead ends: 237 [2020-11-07 05:05:00,156 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 05:05:00,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:05:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 05:05:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 05:05:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 05:05:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 05:05:00,216 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 05:05:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:00,217 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 05:05:00,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:05:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 05:05:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 05:05:00,222 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:00,222 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:00,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:05:00,224 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 05:05:00,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:00,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [924982990] [2020-11-07 05:05:00,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:00,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:00,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:00,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:00,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:00,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:00,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:00,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:00,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 05:05:00,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [924982990] [2020-11-07 05:05:00,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:00,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:05:00,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000943538] [2020-11-07 05:05:00,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:05:00,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:05:00,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:05:00,462 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-11-07 05:05:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:01,273 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 05:05:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:05:01,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-07 05:05:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:01,281 INFO L225 Difference]: With dead ends: 267 [2020-11-07 05:05:01,282 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 05:05:01,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:05:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 05:05:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 05:05:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 05:05:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 05:05:01,342 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 05:05:01,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:01,344 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 05:05:01,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:05:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 05:05:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 05:05:01,347 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:01,348 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:01,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:05:01,348 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-11-07 05:05:01,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:01,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980910946] [2020-11-07 05:05:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-11-07 05:05:01,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [980910946] [2020-11-07 05:05:01,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:01,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:05:01,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260621276] [2020-11-07 05:05:01,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:05:01,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:01,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:05:01,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:05:01,627 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-11-07 05:05:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:02,456 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-11-07 05:05:02,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:05:02,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2020-11-07 05:05:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:02,466 INFO L225 Difference]: With dead ends: 223 [2020-11-07 05:05:02,466 INFO L226 Difference]: Without dead ends: 216 [2020-11-07 05:05:02,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:05:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-07 05:05:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-11-07 05:05:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-07 05:05:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-11-07 05:05:02,542 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 96 [2020-11-07 05:05:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:02,543 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-11-07 05:05:02,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:05:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-11-07 05:05:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 05:05:02,547 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:02,548 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:02,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:05:02,548 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:02,549 INFO L82 PathProgramCache]: Analyzing trace with hash -375801608, now seen corresponding path program 2 times [2020-11-07 05:05:02,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:02,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1931766761] [2020-11-07 05:05:02,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 05:05:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 67 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-11-07 05:05:02,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1931766761] [2020-11-07 05:05:02,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:02,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:05:02,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037511428] [2020-11-07 05:05:02,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:05:02,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:02,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:05:02,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:05:02,837 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 10 states. [2020-11-07 05:05:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:03,666 INFO L93 Difference]: Finished difference Result 455 states and 768 transitions. [2020-11-07 05:05:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:05:03,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2020-11-07 05:05:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:03,673 INFO L225 Difference]: With dead ends: 455 [2020-11-07 05:05:03,673 INFO L226 Difference]: Without dead ends: 262 [2020-11-07 05:05:03,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:05:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-07 05:05:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2020-11-07 05:05:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-11-07 05:05:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2020-11-07 05:05:03,747 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 132 [2020-11-07 05:05:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:03,747 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2020-11-07 05:05:03,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:05:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2020-11-07 05:05:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-11-07 05:05:03,753 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:03,753 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:03,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:05:03,754 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:03,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:03,754 INFO L82 PathProgramCache]: Analyzing trace with hash 974308804, now seen corresponding path program 2 times [2020-11-07 05:05:03,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:03,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1603456030] [2020-11-07 05:05:03,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:03,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:03,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:03,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:03,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 05:05:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 109 proven. 184 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2020-11-07 05:05:04,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1603456030] [2020-11-07 05:05:04,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:04,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:05:04,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474375637] [2020-11-07 05:05:04,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:05:04,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:05:04,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:05:04,308 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 15 states. [2020-11-07 05:05:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:06,764 INFO L93 Difference]: Finished difference Result 441 states and 753 transitions. [2020-11-07 05:05:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 05:05:06,764 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2020-11-07 05:05:06,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:06,768 INFO L225 Difference]: With dead ends: 441 [2020-11-07 05:05:06,768 INFO L226 Difference]: Without dead ends: 171 [2020-11-07 05:05:06,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 05:05:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-11-07 05:05:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2020-11-07 05:05:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 05:05:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2020-11-07 05:05:06,807 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 186 [2020-11-07 05:05:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:06,808 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2020-11-07 05:05:06,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:05:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2020-11-07 05:05:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-11-07 05:05:06,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:06,812 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:06,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:05:06,813 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:06,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash -280620749, now seen corresponding path program 2 times [2020-11-07 05:05:06,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:06,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [909414858] [2020-11-07 05:05:06,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:06,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:06,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:06,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 05:05:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-11-07 05:05:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 235 proven. 217 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2020-11-07 05:05:07,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [909414858] [2020-11-07 05:05:07,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:07,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:05:07,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750415164] [2020-11-07 05:05:07,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:05:07,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:07,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:05:07,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:05:07,353 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand 15 states. [2020-11-07 05:05:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:09,314 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2020-11-07 05:05:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:05:09,315 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 239 [2020-11-07 05:05:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:09,318 INFO L225 Difference]: With dead ends: 265 [2020-11-07 05:05:09,318 INFO L226 Difference]: Without dead ends: 144 [2020-11-07 05:05:09,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 05:05:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-07 05:05:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2020-11-07 05:05:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-11-07 05:05:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2020-11-07 05:05:09,353 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 239 [2020-11-07 05:05:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:09,354 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2020-11-07 05:05:09,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:05:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2020-11-07 05:05:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2020-11-07 05:05:09,360 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:09,360 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 15, 14, 14, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:09,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:05:09,361 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:09,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:09,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1776030340, now seen corresponding path program 3 times [2020-11-07 05:05:09,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:09,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468208022] [2020-11-07 05:05:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 05:05:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-11-07 05:05:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 05:05:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 263 proven. 452 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2020-11-07 05:05:10,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468208022] [2020-11-07 05:05:10,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:10,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:05:10,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849120643] [2020-11-07 05:05:10,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:05:10,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:05:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:05:10,126 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 17 states. [2020-11-07 05:05:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:12,887 INFO L93 Difference]: Finished difference Result 319 states and 438 transitions. [2020-11-07 05:05:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 05:05:12,887 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 292 [2020-11-07 05:05:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:12,891 INFO L225 Difference]: With dead ends: 319 [2020-11-07 05:05:12,891 INFO L226 Difference]: Without dead ends: 190 [2020-11-07 05:05:12,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 05:05:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-11-07 05:05:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 168. [2020-11-07 05:05:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-07 05:05:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2020-11-07 05:05:12,930 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 292 [2020-11-07 05:05:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:12,930 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2020-11-07 05:05:12,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:05:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2020-11-07 05:05:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-07 05:05:12,934 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:12,934 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:12,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:05:12,935 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash -914043270, now seen corresponding path program 4 times [2020-11-07 05:05:12,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:12,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [710971377] [2020-11-07 05:05:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:05:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2020-11-07 05:05:14,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [710971377] [2020-11-07 05:05:14,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:14,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-11-07 05:05:14,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285061315] [2020-11-07 05:05:14,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-07 05:05:14,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:14,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-07 05:05:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:05:14,265 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand 29 states. [2020-11-07 05:05:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:19,304 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2020-11-07 05:05:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-07 05:05:19,304 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 237 [2020-11-07 05:05:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:19,307 INFO L225 Difference]: With dead ends: 181 [2020-11-07 05:05:19,307 INFO L226 Difference]: Without dead ends: 174 [2020-11-07 05:05:19,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=318, Invalid=4794, Unknown=0, NotChecked=0, Total=5112 [2020-11-07 05:05:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-07 05:05:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2020-11-07 05:05:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-07 05:05:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2020-11-07 05:05:19,347 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 237 [2020-11-07 05:05:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:19,348 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2020-11-07 05:05:19,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-07 05:05:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2020-11-07 05:05:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2020-11-07 05:05:19,355 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:19,355 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 16, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:19,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:05:19,355 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:19,356 INFO L82 PathProgramCache]: Analyzing trace with hash -660168264, now seen corresponding path program 5 times [2020-11-07 05:05:19,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:19,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658866166] [2020-11-07 05:05:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 05:05:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:19,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-11-07 05:05:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2067 backedges. 232 proven. 391 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2020-11-07 05:05:20,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658866166] [2020-11-07 05:05:20,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:20,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:05:20,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712308480] [2020-11-07 05:05:20,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:05:20,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:20,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:05:20,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:05:20,316 INFO L87 Difference]: Start difference. First operand 168 states and 207 transitions. Second operand 12 states. [2020-11-07 05:05:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:21,428 INFO L93 Difference]: Finished difference Result 318 states and 406 transitions. [2020-11-07 05:05:21,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:05:21,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 344 [2020-11-07 05:05:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:21,432 INFO L225 Difference]: With dead ends: 318 [2020-11-07 05:05:21,432 INFO L226 Difference]: Without dead ends: 167 [2020-11-07 05:05:21,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:05:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-11-07 05:05:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2020-11-07 05:05:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 05:05:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 200 transitions. [2020-11-07 05:05:21,470 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 200 transitions. Word has length 344 [2020-11-07 05:05:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:21,471 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 200 transitions. [2020-11-07 05:05:21,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:05:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 200 transitions. [2020-11-07 05:05:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2020-11-07 05:05:21,476 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:21,476 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:21,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:05:21,477 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash 569490289, now seen corresponding path program 6 times [2020-11-07 05:05:21,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:21,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1983788595] [2020-11-07 05:05:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:05:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 05:05:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:22,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:22,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:22,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:22,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:22,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:22,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:22,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 256 proven. 391 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2020-11-07 05:05:22,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1983788595] [2020-11-07 05:05:22,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:22,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:05:22,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195591482] [2020-11-07 05:05:22,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:05:22,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:22,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:05:22,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:05:22,165 INFO L87 Difference]: Start difference. First operand 164 states and 200 transitions. Second operand 15 states. [2020-11-07 05:05:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:23,952 INFO L93 Difference]: Finished difference Result 323 states and 410 transitions. [2020-11-07 05:05:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:05:23,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 290 [2020-11-07 05:05:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:23,955 INFO L225 Difference]: With dead ends: 323 [2020-11-07 05:05:23,956 INFO L226 Difference]: Without dead ends: 177 [2020-11-07 05:05:23,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:05:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-11-07 05:05:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2020-11-07 05:05:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-11-07 05:05:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 208 transitions. [2020-11-07 05:05:23,993 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 208 transitions. Word has length 290 [2020-11-07 05:05:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:23,994 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 208 transitions. [2020-11-07 05:05:23,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:05:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 208 transitions. [2020-11-07 05:05:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2020-11-07 05:05:23,998 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:23,998 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 21, 20, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 8, 8, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:23,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:05:23,999 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash 242910628, now seen corresponding path program 7 times [2020-11-07 05:05:23,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:24,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [867190361] [2020-11-07 05:05:24,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:05:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 05:05:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:05:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3985 backedges. 206 proven. 755 refuted. 0 times theorem prover too weak. 3024 trivial. 0 not checked. [2020-11-07 05:05:25,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [867190361] [2020-11-07 05:05:25,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:25,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:05:25,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881280953] [2020-11-07 05:05:25,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:05:25,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:05:25,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:05:25,081 INFO L87 Difference]: Start difference. First operand 171 states and 208 transitions. Second operand 13 states. [2020-11-07 05:05:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:26,489 INFO L93 Difference]: Finished difference Result 198 states and 245 transitions. [2020-11-07 05:05:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:05:26,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 466 [2020-11-07 05:05:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:26,491 INFO L225 Difference]: With dead ends: 198 [2020-11-07 05:05:26,492 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:05:26,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2020-11-07 05:05:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:05:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:05:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:05:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:05:26,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 466 [2020-11-07 05:05:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:26,496 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:05:26,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:05:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:05:26,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:05:26,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 05:05:26,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:05:39,952 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 8 [2020-11-07 05:05:40,180 WARN L194 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 6 [2020-11-07 05:05:40,450 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 6 [2020-11-07 05:05:41,050 WARN L194 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 31 [2020-11-07 05:05:41,268 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 6 [2020-11-07 05:05:42,404 WARN L194 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 151 DAG size of output: 49 [2020-11-07 05:05:43,388 WARN L194 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 39 [2020-11-07 05:05:44,007 WARN L194 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 31 [2020-11-07 05:05:45,060 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 141 DAG size of output: 43 [2020-11-07 05:05:46,066 WARN L194 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 43 [2020-11-07 05:05:46,206 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 6 [2020-11-07 05:05:46,804 WARN L194 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 20 [2020-11-07 05:05:47,392 WARN L194 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 27 [2020-11-07 05:05:48,246 WARN L194 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 35 [2020-11-07 05:05:48,938 WARN L194 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 27 [2020-11-07 05:05:49,147 WARN L194 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 6 [2020-11-07 05:05:50,725 WARN L194 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 182 DAG size of output: 39 [2020-11-07 05:05:50,925 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 7 [2020-11-07 05:05:51,492 WARN L194 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 20 [2020-11-07 05:05:52,420 WARN L194 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 35 [2020-11-07 05:05:53,057 WARN L194 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 37 [2020-11-07 05:05:53,630 WARN L194 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 31 [2020-11-07 05:05:53,814 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 8 [2020-11-07 05:05:55,494 WARN L194 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 182 DAG size of output: 39 [2020-11-07 05:05:55,736 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 3 [2020-11-07 05:05:55,745 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,745 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,746 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,746 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,746 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,746 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,746 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:05:55,747 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:05:55,747 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,747 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 05:05:55,747 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,747 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,748 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 05:05:55,748 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:05:55,748 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:05:55,748 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:05:55,748 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:05:55,748 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:05:55,748 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-11-07 05:05:55,748 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (<= 6 main_~x~0) [2020-11-07 05:05:55,749 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (<= 6 main_~x~0) [2020-11-07 05:05:55,749 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-11-07 05:05:55,749 INFO L262 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-11-07 05:05:55,749 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-11-07 05:05:55,749 INFO L262 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6)) [2020-11-07 05:05:55,749 INFO L262 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 8 |main_#t~ret11|) (<= 6 main_~x~0) (<= |main_#t~ret11| 8) (<= main_~x~0 6)) [2020-11-07 05:05:55,750 INFO L262 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 6 main_~x~0) [2020-11-07 05:05:55,750 INFO L262 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= 8 |main_#t~ret11|) (<= 6 main_~x~0) (<= |main_#t~ret11| 8) (<= main_~x~0 6)) [2020-11-07 05:05:55,750 INFO L262 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= 8 |main_#t~ret11|) (<= 6 main_~x~0) (<= |main_#t~ret11| 8) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-11-07 05:05:55,750 INFO L269 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-11-07 05:05:55,750 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 2))) [2020-11-07 05:05:55,750 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= 5 |fibo2_#in~n|)) (and (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n) (<= |fibo2_#t~ret9| 1) .cse0 (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 05:05:55,750 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1) (< 0 fibo2_~n)) [2020-11-07 05:05:55,751 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= 5 |fibo2_#in~n|)) (and (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n) (<= |fibo2_#t~ret9| 1) .cse0 (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 05:05:55,751 INFO L262 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-11-07 05:05:55,751 INFO L262 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (or (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= .cse1 5) (<= 5 |fibo2_#in~n|) (<= 5 .cse1)) (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 3) (<= 2 .cse1) (<= 3 fibo2_~n) (<= |fibo2_#t~ret9| 1) .cse0 (<= .cse1 2) (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 05:05:55,751 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-11-07 05:05:55,751 INFO L262 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (or (and (<= |fibo2_#t~ret9| 3) (<= 3 |fibo2_#t~ret9|) .cse0 (<= .cse1 5) (<= 5 |fibo2_#in~n|) (<= 5 .cse1)) (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 3) (<= 2 .cse1) (<= 3 fibo2_~n) (<= |fibo2_#t~ret9| 1) .cse0 (<= .cse1 2) (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 05:05:55,752 INFO L262 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-11-07 05:05:55,752 INFO L262 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse1 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n) .cse0) (and (<= |fibo2_#t~ret9| 3) (<= |fibo2_#res| 5) (<= 3 |fibo2_#t~ret9|) .cse0 (<= .cse1 5) (<= 5 |fibo2_#res|) (<= 5 .cse1)))) (or (not (<= |fibo2_#in~n| 4)) (and (<= 2 .cse1) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= |fibo2_#t~ret9| 1) (<= .cse1 2) (<= 1 |fibo2_#t~ret9|))))) [2020-11-07 05:05:55,752 INFO L262 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 6 fibo2_~n) .cse0) (and (<= |fibo2_#in~n| 3) (<= 3 fibo2_~n) .cse0) (and (<= |fibo2_#t~ret9| 3) (<= |fibo2_#res| 5) (<= 3 |fibo2_#t~ret9|) .cse0 (<= 5 |fibo2_#res|)))) (or (not (<= |fibo2_#in~n| 4)) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= |fibo2_#t~ret9| 1) (<= 1 |fibo2_#t~ret9|)))) [2020-11-07 05:05:55,752 INFO L262 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= 6 fibo2_~n) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)) (and (<= |fibo2_#res| 5) (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 1))) (or (and .cse0 (< 0 fibo2_~n)) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))))) [2020-11-07 05:05:55,753 INFO L262 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (and (or (and (<= 6 fibo2_~n) .cse0) (and .cse0 (<= |fibo2_#in~n| 0)) (and (<= |fibo2_#res| 5) (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 3 fibo2_~n) (<= 2 |fibo2_#res|)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= |fibo2_#in~n| 1))) (or (and .cse0 (< 0 fibo2_~n)) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))))) [2020-11-07 05:05:55,753 INFO L269 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-11-07 05:05:55,753 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 05:05:55,753 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (let ((.cse2 (<= 5 |fibo1_#in~n|)) (.cse1 (<= fibo1_~n 5)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|) .cse0) (and .cse1 .cse0 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and .cse2 (<= 5 |fibo1_#t~ret7|) .cse0 (<= |fibo1_#t~ret7| 5)) (and .cse2 .cse1 .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) (or (not (<= |fibo1_#in~n| 3)) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1)))) [2020-11-07 05:05:55,753 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 05:05:55,754 INFO L262 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (let ((.cse2 (<= 5 |fibo1_#in~n|)) (.cse1 (<= fibo1_~n 5)) (.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|) .cse0) (and .cse1 .cse0 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and .cse2 (<= 5 |fibo1_#t~ret7|) .cse0 (<= |fibo1_#t~ret7| 5)) (and .cse2 .cse1 .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) (or (not (<= |fibo1_#in~n| 3)) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1)))) [2020-11-07 05:05:55,754 INFO L262 CegarLoopResult]: At program point L12(lines 12 16) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-11-07 05:05:55,754 INFO L262 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|)) (.cse4 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (let ((.cse0 (and (or (and (<= fibo1_~n 5) .cse1) (and (<= 5 |fibo1_#t~ret7|) .cse1 (<= 8 .cse4) (<= |fibo1_#t~ret7| 5) (<= .cse4 8))) (<= 5 fibo1_~n))) (.cse2 (and (<= 7 |fibo1_#in~n|) .cse1)) (.cse3 (and (<= .cse4 3) (<= 3 .cse4) (<= 4 |fibo1_#in~n|) .cse1 (<= |fibo1_#t~ret7| 2) (<= |fibo1_#in~n| 4) (<= 2 |fibo1_#t~ret7|)))) (and (or .cse0 (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|) .cse1) .cse2 .cse3) (or (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse4) (<= |fibo1_#t~ret7| 1) (<= .cse4 1)) .cse0 .cse2 .cse3)))) [2020-11-07 05:05:55,754 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 05:05:55,754 INFO L262 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|)) (.cse4 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (let ((.cse0 (and (or (and (<= fibo1_~n 5) .cse1) (and (<= 5 |fibo1_#t~ret7|) .cse1 (<= 8 .cse4) (<= |fibo1_#t~ret7| 5) (<= .cse4 8))) (<= 5 fibo1_~n))) (.cse2 (and (<= 7 |fibo1_#in~n|) .cse1)) (.cse3 (and (<= .cse4 3) (<= 3 .cse4) (<= 4 |fibo1_#in~n|) .cse1 (<= |fibo1_#t~ret7| 2) (<= |fibo1_#in~n| 4) (<= 2 |fibo1_#t~ret7|)))) (and (or .cse0 (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|) .cse1) .cse2 .cse3) (or (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse4) (<= |fibo1_#t~ret7| 1) (<= .cse4 1)) .cse0 .cse2 .cse3)))) [2020-11-07 05:05:55,755 INFO L262 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (and (or (and (or (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8)) (<= fibo1_~n 5)) (<= 5 fibo1_~n)) (not (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) (<= |fibo1_#in~n| 4)) (<= 7 |fibo1_#in~n|)) (or (<= |fibo1_#in~n| 0) (not (<= |fibo1_#in~n| 3)) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))) (= fibo1_~n |fibo1_#in~n|) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 05:05:55,755 INFO L262 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-11-07 05:05:55,755 INFO L262 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) (<= .cse0 3) (<= 3 .cse0) (<= |fibo1_#t~ret7| 2) (<= |fibo1_#in~n| 4) (<= 2 |fibo1_#t~ret7|)) (<= 7 |fibo1_#in~n|) (and (<= |fibo1_#in~n| 2) (<= 2 |fibo1_#in~n|)) (and (or (<= fibo1_~n 5) (and (<= 8 |fibo1_#res|) (<= 5 |fibo1_#t~ret7|) (<= |fibo1_#res| 8) (<= 8 .cse0) (<= |fibo1_#t~ret7| 5) (<= .cse0 8))) (<= 5 fibo1_~n))) (or (not (<= |fibo1_#in~n| 3)) (and (<= 1 |fibo1_#t~ret7|) (<= 1 .cse0) (<= |fibo1_#t~ret7| 1) (<= |fibo1_#res| 1) (<= .cse0 1) (<= 1 |fibo1_#res|))) (= fibo1_~n |fibo1_#in~n|))) [2020-11-07 05:05:55,755 INFO L262 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (and (or (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#in~n| 2) (<= |fibo1_#t~ret7| 1) (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (<= 7 |fibo1_#in~n|) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) (<= 4 |fibo1_#in~n|) (<= |fibo1_#t~ret7| 2) (<= |fibo1_#in~n| 4) (<= 2 |fibo1_#t~ret7|)) (and (<= 5 fibo1_~n) (or (and (<= 8 |fibo1_#res|) (<= 5 |fibo1_#t~ret7|) (<= |fibo1_#res| 8) (<= |fibo1_#t~ret7| 5)) (<= fibo1_~n 5)))) (<= 2 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 05:05:55,756 INFO L262 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (and (or (and (or (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8)) (<= fibo1_~n 5)) (<= 5 fibo1_~n)) (not (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) (<= |fibo1_#in~n| 4)) (<= 7 |fibo1_#in~n|)) (or (<= |fibo1_#in~n| 0) (not (<= |fibo1_#in~n| 3)) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))) (= fibo1_~n |fibo1_#in~n|) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 05:05:55,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:05:55 BoogieIcfgContainer [2020-11-07 05:05:55,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:05:55,781 INFO L168 Benchmark]: Toolchain (without parser) took 63202.78 ms. Allocated memory was 158.3 MB in the beginning and 574.6 MB in the end (delta: 416.3 MB). Free memory was 135.0 MB in the beginning and 222.0 MB in the end (delta: -87.0 MB). Peak memory consumption was 349.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:55,782 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 158.3 MB. Free memory was 132.7 MB in the beginning and 132.6 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:05:55,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.01 ms. Allocated memory is still 158.3 MB. Free memory was 134.3 MB in the beginning and 125.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:55,783 INFO L168 Benchmark]: Boogie Preprocessor took 36.02 ms. Allocated memory is still 158.3 MB. Free memory was 125.0 MB in the beginning and 123.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:55,784 INFO L168 Benchmark]: RCFGBuilder took 538.29 ms. Allocated memory is still 158.3 MB. Free memory was 123.7 MB in the beginning and 140.6 MB in the end (delta: -16.9 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:55,784 INFO L168 Benchmark]: TraceAbstraction took 62334.10 ms. Allocated memory was 158.3 MB in the beginning and 574.6 MB in the end (delta: 416.3 MB). Free memory was 140.1 MB in the beginning and 222.0 MB in the end (delta: -81.9 MB). Peak memory consumption was 355.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:55,787 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.27 ms. Allocated memory is still 158.3 MB. Free memory was 132.7 MB in the beginning and 132.6 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 272.01 ms. Allocated memory is still 158.3 MB. Free memory was 134.3 MB in the beginning and 125.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.02 ms. Allocated memory is still 158.3 MB. Free memory was 125.0 MB in the beginning and 123.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 538.29 ms. Allocated memory is still 158.3 MB. Free memory was 123.7 MB in the beginning and 140.6 MB in the end (delta: -16.9 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 62334.10 ms. Allocated memory was 158.3 MB in the beginning and 574.6 MB in the end (delta: 416.3 MB). Free memory was 140.1 MB in the beginning and 222.0 MB in the end (delta: -81.9 MB). Peak memory consumption was 355.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 37]: Procedure Contract for main Derived contract for procedure main: 6 <= x - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((((6 <= n && n == \old(n)) || (n == \old(n) && \old(n) <= 0)) || ((\result <= 5 && 5 <= \old(n)) && 5 <= \result)) || (((\old(n) <= 3 && \result <= 2) && 3 <= n) && 2 <= \result)) || ((1 <= \result && \result <= 1) && \old(n) <= 1)) && ((n == \old(n) && 0 < n) || (\result <= 0 && 0 <= \result)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((((((((8 <= \result && \result <= 8) || n <= 5) && 5 <= n) || !(3 <= \old(n))) || ((\result <= 3 && 3 <= \result) && \old(n) <= 4)) || 7 <= \old(n)) && ((\old(n) <= 0 || !(\old(n) <= 3)) || (\result <= 1 && 1 <= \result))) && n == \old(n)) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 32.9s, OverallIterations: 18, TraceHistogramMax: 26, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1031 SDtfs, 1642 SDslu, 2610 SDs, 0 SdLazy, 9432 SolverSat, 824 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2361 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 3289 PreInvPairs, 7144 NumberOfFragments, 1385 HoareAnnotationTreeSize, 3289 FomulaSimplifications, 1228049 FormulaSimplificationTreeSizeReduction, 13.1s HoareSimplificationTime, 57 FomulaSimplificationsInter, 135176 FormulaSimplificationTreeSizeReductionInter, 15.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2755 NumberOfCodeBlocks, 2755 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2737 ConstructedInterpolants, 0 QuantifiedInterpolants, 1276247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 8840/11724 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...