/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:27:12,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:27:12,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:27:12,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:27:12,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:27:12,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:27:12,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:27:12,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:27:12,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:27:12,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:27:12,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:27:12,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:27:12,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:27:12,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:27:12,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:27:12,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:27:12,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:27:12,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:27:12,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:27:12,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:27:12,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:27:12,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:27:12,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:27:12,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:27:12,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:27:12,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:27:12,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:27:12,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:27:12,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:27:12,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:27:12,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:27:12,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:27:12,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:27:12,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:27:12,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:27:12,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:27:12,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:27:12,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:27:12,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:27:12,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:27:12,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:27:12,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:27:12,946 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:27:12,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:27:12,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:27:12,948 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:27:12,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:27:12,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:27:12,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:27:12,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:27:12,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:27:12,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:27:12,950 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:27:12,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:27:12,950 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:27:12,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:27:12,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:27:12,951 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:27:12,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:27:12,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:27:12,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:27:12,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:27:12,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:27:12,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:27:12,952 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 20:27:13,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:27:13,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:27:13,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:27:13,406 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:27:13,407 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:27:13,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-1.c [2020-10-23 20:27:13,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c32242d/83d7fd051cd64ca0bfb8b13fd78b77bf/FLAGc9c6c0015 [2020-10-23 20:27:14,125 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:27:14,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i15_o15-1.c [2020-10-23 20:27:14,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c32242d/83d7fd051cd64ca0bfb8b13fd78b77bf/FLAGc9c6c0015 [2020-10-23 20:27:14,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c32242d/83d7fd051cd64ca0bfb8b13fd78b77bf [2020-10-23 20:27:14,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:27:14,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:27:14,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:14,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:27:14,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:27:14,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c9c7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14, skipping insertion in model container [2020-10-23 20:27:14,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:27:14,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:27:14,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:14,809 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:27:14,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:14,844 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:27:14,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14 WrapperNode [2020-10-23 20:27:14,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:14,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:27:14,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:27:14,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:27:14,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:27:14,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:27:14,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:27:14,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:27:14,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:27:14,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:27:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:27:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:27:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-23 20:27:14,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:27:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 20:27:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:27:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:27:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:27:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:27:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-23 20:27:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:27:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:27:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:27:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:27:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:27:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:27:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:27:15,285 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:27:15,286 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:27:15,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:15 BoogieIcfgContainer [2020-10-23 20:27:15,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:27:15,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:27:15,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:27:15,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:27:15,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:27:14" (1/3) ... [2020-10-23 20:27:15,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b76701e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:15, skipping insertion in model container [2020-10-23 20:27:15,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14" (2/3) ... [2020-10-23 20:27:15,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b76701e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:15, skipping insertion in model container [2020-10-23 20:27:15,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:15" (3/3) ... [2020-10-23 20:27:15,297 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i15_o15-1.c [2020-10-23 20:27:15,310 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:27:15,316 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:27:15,331 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:27:15,371 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:27:15,371 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:27:15,372 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:27:15,372 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:27:15,372 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:27:15,372 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:27:15,372 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:27:15,372 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:27:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-10-23 20:27:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-23 20:27:15,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:15,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:15,406 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:15,423 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-10-23 20:27:15,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:15,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823895090] [2020-10-23 20:27:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:15,620 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:15,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:15,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:27:15,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823895090] [2020-10-23 20:27:15,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:15,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:27:15,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780678910] [2020-10-23 20:27:15,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:27:15,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:15,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:27:15,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:27:15,973 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-10-23 20:27:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:16,352 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-10-23 20:27:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 20:27:16,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-23 20:27:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:16,366 INFO L225 Difference]: With dead ends: 50 [2020-10-23 20:27:16,366 INFO L226 Difference]: Without dead ends: 32 [2020-10-23 20:27:16,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:27:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-23 20:27:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-23 20:27:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-23 20:27:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-23 20:27:16,425 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-10-23 20:27:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:16,425 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-23 20:27:16,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:27:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-23 20:27:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-23 20:27:16,428 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:16,428 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] [2020-10-23 20:27:16,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:27:16,429 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-10-23 20:27:16,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:16,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1074531001] [2020-10-23 20:27:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:16,435 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-23 20:27:16,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1074531001] [2020-10-23 20:27:16,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:16,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:27:16,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846873462] [2020-10-23 20:27:16,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:27:16,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:16,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:27:16,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:27:16,644 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-10-23 20:27:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:16,885 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-23 20:27:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:27:16,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-23 20:27:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:16,887 INFO L225 Difference]: With dead ends: 44 [2020-10-23 20:27:16,888 INFO L226 Difference]: Without dead ends: 37 [2020-10-23 20:27:16,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:27:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-23 20:27:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-23 20:27:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-23 20:27:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-23 20:27:16,903 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-10-23 20:27:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:16,904 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-23 20:27:16,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:27:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-23 20:27:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-23 20:27:16,906 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:16,906 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:16,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:27:16,907 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-10-23 20:27:16,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:16,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661532593] [2020-10-23 20:27:16,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:16,912 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-23 20:27:17,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661532593] [2020-10-23 20:27:17,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:17,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:27:17,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050937404] [2020-10-23 20:27:17,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:27:17,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:17,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:27:17,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:27:17,101 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-10-23 20:27:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:17,411 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-23 20:27:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:27:17,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-23 20:27:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:17,413 INFO L225 Difference]: With dead ends: 49 [2020-10-23 20:27:17,414 INFO L226 Difference]: Without dead ends: 42 [2020-10-23 20:27:17,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:27:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-23 20:27:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-23 20:27:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-23 20:27:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-23 20:27:17,428 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-10-23 20:27:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:17,428 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-23 20:27:17,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:27:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-10-23 20:27:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-23 20:27:17,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:17,431 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1] [2020-10-23 20:27:17,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:27:17,431 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-10-23 20:27:17,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:17,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [8730007] [2020-10-23 20:27:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:17,435 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-23 20:27:17,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [8730007] [2020-10-23 20:27:17,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:17,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:27:17,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323973854] [2020-10-23 20:27:17,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:27:17,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:17,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:27:17,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:27:17,684 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-10-23 20:27:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:18,068 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-23 20:27:18,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:27:18,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-23 20:27:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:18,071 INFO L225 Difference]: With dead ends: 54 [2020-10-23 20:27:18,072 INFO L226 Difference]: Without dead ends: 47 [2020-10-23 20:27:18,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:27:18,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-23 20:27:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-23 20:27:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-23 20:27:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-23 20:27:18,086 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-10-23 20:27:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:18,087 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-23 20:27:18,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:27:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-23 20:27:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-23 20:27:18,089 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:18,089 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:18,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:27:18,089 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-10-23 20:27:18,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:18,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [594754792] [2020-10-23 20:27:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:18,094 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-23 20:27:18,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [594754792] [2020-10-23 20:27:18,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:18,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:27:18,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343436845] [2020-10-23 20:27:18,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:27:18,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:27:18,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:27:18,326 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-10-23 20:27:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:18,828 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-10-23 20:27:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:27:18,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-23 20:27:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:18,834 INFO L225 Difference]: With dead ends: 59 [2020-10-23 20:27:18,834 INFO L226 Difference]: Without dead ends: 52 [2020-10-23 20:27:18,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:27:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-23 20:27:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-23 20:27:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-23 20:27:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-10-23 20:27:18,862 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-10-23 20:27:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:18,863 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-10-23 20:27:18,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:27:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-10-23 20:27:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 20:27:18,868 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:18,868 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:18,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:27:18,868 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-10-23 20:27:18,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:18,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [805686278] [2020-10-23 20:27:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:18,880 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-23 20:27:19,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [805686278] [2020-10-23 20:27:19,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:19,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:27:19,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695371622] [2020-10-23 20:27:19,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:27:19,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:19,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:27:19,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:27:19,183 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-10-23 20:27:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:19,688 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-10-23 20:27:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:27:19,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-23 20:27:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:19,690 INFO L225 Difference]: With dead ends: 64 [2020-10-23 20:27:19,690 INFO L226 Difference]: Without dead ends: 57 [2020-10-23 20:27:19,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:27:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-23 20:27:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-23 20:27:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-23 20:27:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-23 20:27:19,707 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-10-23 20:27:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:19,708 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-23 20:27:19,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:27:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-23 20:27:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-23 20:27:19,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:19,709 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:19,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:27:19,710 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-10-23 20:27:19,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:19,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [949701807] [2020-10-23 20:27:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:19,715 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-23 20:27:19,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [949701807] [2020-10-23 20:27:19,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:19,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:27:19,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423581056] [2020-10-23 20:27:19,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:27:19,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:19,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:27:19,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:27:19,973 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-10-23 20:27:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:20,521 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-23 20:27:20,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:27:20,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-23 20:27:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:20,524 INFO L225 Difference]: With dead ends: 69 [2020-10-23 20:27:20,524 INFO L226 Difference]: Without dead ends: 62 [2020-10-23 20:27:20,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:27:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-23 20:27:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-23 20:27:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-23 20:27:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-10-23 20:27:20,541 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-10-23 20:27:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:20,541 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-10-23 20:27:20,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:27:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-10-23 20:27:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:27:20,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:20,543 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:20,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:27:20,544 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-10-23 20:27:20,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:20,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1669246194] [2020-10-23 20:27:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:20,549 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-23 20:27:20,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1669246194] [2020-10-23 20:27:20,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:20,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:27:20,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155453731] [2020-10-23 20:27:20,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:27:20,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:20,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:27:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:27:20,873 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-10-23 20:27:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:21,444 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-10-23 20:27:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:27:21,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-10-23 20:27:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:21,448 INFO L225 Difference]: With dead ends: 74 [2020-10-23 20:27:21,448 INFO L226 Difference]: Without dead ends: 67 [2020-10-23 20:27:21,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:27:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-23 20:27:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-23 20:27:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-23 20:27:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-23 20:27:21,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-10-23 20:27:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:21,480 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-23 20:27:21,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:27:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-23 20:27:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-23 20:27:21,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:21,481 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:21,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:27:21,482 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-10-23 20:27:21,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:21,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [653789142] [2020-10-23 20:27:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:21,487 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-23 20:27:21,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [653789142] [2020-10-23 20:27:21,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:21,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:27:21,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376771326] [2020-10-23 20:27:21,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:27:21,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:21,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:27:21,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:27:21,815 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-10-23 20:27:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:22,535 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-23 20:27:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:27:22,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-10-23 20:27:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:22,538 INFO L225 Difference]: With dead ends: 79 [2020-10-23 20:27:22,538 INFO L226 Difference]: Without dead ends: 72 [2020-10-23 20:27:22,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:27:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-23 20:27:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-23 20:27:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-23 20:27:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-10-23 20:27:22,564 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-10-23 20:27:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:22,565 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-10-23 20:27:22,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:27:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-10-23 20:27:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-23 20:27:22,566 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:22,567 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:22,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:27:22,567 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-10-23 20:27:22,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:22,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1253688715] [2020-10-23 20:27:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:22,573 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-23 20:27:22,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1253688715] [2020-10-23 20:27:22,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:22,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:27:22,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584172823] [2020-10-23 20:27:22,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:27:22,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:27:22,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:27:22,974 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-10-23 20:27:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:23,698 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-23 20:27:23,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:27:23,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-10-23 20:27:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:23,700 INFO L225 Difference]: With dead ends: 84 [2020-10-23 20:27:23,701 INFO L226 Difference]: Without dead ends: 77 [2020-10-23 20:27:23,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:27:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-23 20:27:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-23 20:27:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-23 20:27:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-23 20:27:23,732 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-10-23 20:27:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:23,734 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-23 20:27:23,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:27:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-23 20:27:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-23 20:27:23,737 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:23,737 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:23,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:27:23,737 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:23,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-10-23 20:27:23,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:23,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302021563] [2020-10-23 20:27:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:23,745 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-10-23 20:27:24,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302021563] [2020-10-23 20:27:24,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:24,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-23 20:27:24,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975500727] [2020-10-23 20:27:24,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 20:27:24,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:24,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 20:27:24,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-23 20:27:24,314 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-10-23 20:27:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:25,107 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-10-23 20:27:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:27:25,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-10-23 20:27:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:25,109 INFO L225 Difference]: With dead ends: 89 [2020-10-23 20:27:25,109 INFO L226 Difference]: Without dead ends: 82 [2020-10-23 20:27:25,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-23 20:27:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-23 20:27:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-23 20:27:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-23 20:27:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-10-23 20:27:25,141 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-10-23 20:27:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:25,142 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-10-23 20:27:25,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 20:27:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-10-23 20:27:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-23 20:27:25,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:25,144 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:25,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:27:25,144 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:25,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:25,145 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-10-23 20:27:25,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:25,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1699081301] [2020-10-23 20:27:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:25,154 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-10-23 20:27:25,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1699081301] [2020-10-23 20:27:25,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:25,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-23 20:27:25,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327603189] [2020-10-23 20:27:25,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 20:27:25,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:25,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 20:27:25,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:27:25,722 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-10-23 20:27:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:26,562 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-10-23 20:27:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:27:26,562 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-10-23 20:27:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:26,564 INFO L225 Difference]: With dead ends: 94 [2020-10-23 20:27:26,564 INFO L226 Difference]: Without dead ends: 87 [2020-10-23 20:27:26,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-23 20:27:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-23 20:27:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-23 20:27:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-23 20:27:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-23 20:27:26,580 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-10-23 20:27:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:26,581 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-23 20:27:26,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 20:27:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-23 20:27:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-23 20:27:26,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:26,582 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:26,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:27:26,583 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-10-23 20:27:26,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:26,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618364874] [2020-10-23 20:27:26,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:26,590 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-10-23 20:27:27,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618364874] [2020-10-23 20:27:27,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:27,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-23 20:27:27,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570336954] [2020-10-23 20:27:27,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-23 20:27:27,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:27,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-23 20:27:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-23 20:27:27,178 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-10-23 20:27:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:28,054 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-10-23 20:27:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 20:27:28,055 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-10-23 20:27:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:28,057 INFO L225 Difference]: With dead ends: 99 [2020-10-23 20:27:28,057 INFO L226 Difference]: Without dead ends: 92 [2020-10-23 20:27:28,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 20:27:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-23 20:27:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-23 20:27:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-23 20:27:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-10-23 20:27:28,080 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-10-23 20:27:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:28,080 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-10-23 20:27:28,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-23 20:27:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-10-23 20:27:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-23 20:27:28,082 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:28,082 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:28,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:27:28,083 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-10-23 20:27:28,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:28,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1714743053] [2020-10-23 20:27:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:28,091 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-10-23 20:27:28,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1714743053] [2020-10-23 20:27:28,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:28,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-23 20:27:28,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361450425] [2020-10-23 20:27:28,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 20:27:28,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:28,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 20:27:28,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:27:28,683 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-10-23 20:27:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:29,622 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-10-23 20:27:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 20:27:29,623 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-10-23 20:27:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:29,624 INFO L225 Difference]: With dead ends: 104 [2020-10-23 20:27:29,624 INFO L226 Difference]: Without dead ends: 97 [2020-10-23 20:27:29,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 20:27:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-23 20:27:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-23 20:27:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-23 20:27:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-10-23 20:27:29,642 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-10-23 20:27:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:29,643 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-10-23 20:27:29,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 20:27:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-10-23 20:27:29,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-23 20:27:29,646 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:29,647 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:29,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:27:29,647 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:29,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:29,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-10-23 20:27:29,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:29,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1046909436] [2020-10-23 20:27:29,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:29,656 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-10-23 20:27:30,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1046909436] [2020-10-23 20:27:30,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:30,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-23 20:27:30,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480323153] [2020-10-23 20:27:30,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 20:27:30,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:30,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 20:27:30,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:27:30,384 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-10-23 20:27:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:31,374 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-10-23 20:27:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 20:27:31,375 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-10-23 20:27:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:31,377 INFO L225 Difference]: With dead ends: 109 [2020-10-23 20:27:31,377 INFO L226 Difference]: Without dead ends: 102 [2020-10-23 20:27:31,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-23 20:27:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-23 20:27:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-23 20:27:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-23 20:27:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-10-23 20:27:31,398 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-10-23 20:27:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:31,400 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-10-23 20:27:31,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 20:27:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-10-23 20:27:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-10-23 20:27:31,401 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:31,402 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:31,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:27:31,402 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:31,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-10-23 20:27:31,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:31,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735280429] [2020-10-23 20:27:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:31,417 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:31,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:32,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-10-23 20:27:33,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735280429] [2020-10-23 20:27:33,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:33,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2020-10-23 20:27:33,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243642641] [2020-10-23 20:27:33,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-10-23 20:27:33,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:33,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-10-23 20:27:33,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2020-10-23 20:27:33,284 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 36 states. [2020-10-23 20:27:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:38,514 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-10-23 20:27:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-10-23 20:27:38,515 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 145 [2020-10-23 20:27:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:38,518 INFO L225 Difference]: With dead ends: 114 [2020-10-23 20:27:38,518 INFO L226 Difference]: Without dead ends: 107 [2020-10-23 20:27:38,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=313, Invalid=6827, Unknown=0, NotChecked=0, Total=7140 [2020-10-23 20:27:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-23 20:27:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-23 20:27:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-23 20:27:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-10-23 20:27:38,538 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-10-23 20:27:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:38,538 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-10-23 20:27:38,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-10-23 20:27:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-10-23 20:27:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-23 20:27:38,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:38,541 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:38,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:27:38,541 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:38,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:38,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-10-23 20:27:38,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:38,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1709488307] [2020-10-23 20:27:38,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:38,546 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:38,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-10-23 20:27:39,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1709488307] [2020-10-23 20:27:39,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:39,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-10-23 20:27:39,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981268174] [2020-10-23 20:27:39,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-23 20:27:39,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:39,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-23 20:27:39,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2020-10-23 20:27:39,503 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-10-23 20:27:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:42,644 INFO L93 Difference]: Finished difference Result 225 states and 481 transitions. [2020-10-23 20:27:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-10-23 20:27:42,650 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-10-23 20:27:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:42,650 INFO L225 Difference]: With dead ends: 225 [2020-10-23 20:27:42,651 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:27:42,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=916, Invalid=2164, Unknown=0, NotChecked=0, Total=3080 [2020-10-23 20:27:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:27:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:27:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:27:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:27:42,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2020-10-23 20:27:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:42,655 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:27:42,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-23 20:27:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:27:42,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:27:42,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 20:27:42,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:27:45,767 WARN L193 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 101 [2020-10-23 20:27:45,889 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 3 [2020-10-23 20:27:47,037 WARN L193 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 101 [2020-10-23 20:27:47,277 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 3 [2020-10-23 20:27:48,131 WARN L193 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 97 [2020-10-23 20:27:49,009 WARN L193 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 97 [2020-10-23 20:27:50,080 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 195 DAG size of output: 128 [2020-10-23 20:27:50,094 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,095 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,095 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,095 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,095 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,095 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,095 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:27:50,095 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:27:50,095 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,096 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:27:50,096 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,096 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,096 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-23 20:27:50,096 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:27:50,096 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:27:50,096 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:27:50,096 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:27:50,096 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:27:50,097 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-10-23 20:27:50,097 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: (= 15 main_~input~0) [2020-10-23 20:27:50,097 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-10-23 20:27:50,097 INFO L270 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (= 15 main_~input~0) (<= 15 main_~result~0) (<= main_~result~0 15)) [2020-10-23 20:27:50,097 INFO L270 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: false [2020-10-23 20:27:50,097 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= 15 main_~input~0) [2020-10-23 20:27:50,097 INFO L270 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 15) (<= 15 |main_#t~ret8|) (= 15 main_~input~0)) [2020-10-23 20:27:50,098 INFO L270 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: (= 15 main_~input~0) [2020-10-23 20:27:50,098 INFO L270 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 15) (<= 15 |main_#t~ret8|) (= 15 main_~input~0)) [2020-10-23 20:27:50,098 INFO L270 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 15) (<= 15 |main_#t~ret8|) (= 15 main_~input~0) (<= 15 main_~result~0) (<= main_~result~0 15)) [2020-10-23 20:27:50,098 INFO L270 CegarLoopResult]: At program point idFINAL(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= 16 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#res| 15)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)))) [2020-10-23 20:27:50,099 INFO L270 CegarLoopResult]: At program point idEXIT(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= 16 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#res| 15)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)))) [2020-10-23 20:27:50,099 INFO L270 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-23 20:27:50,099 INFO L277 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2020-10-23 20:27:50,099 INFO L270 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-23 20:27:50,099 INFO L270 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 12 |id_#in~x|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and .cse0 (<= 16 |id_#in~x|)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= 14 |id_#t~ret7|)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= 12 |id_#t~ret7|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)))) [2020-10-23 20:27:50,099 INFO L270 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-10-23 20:27:50,100 INFO L270 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 12 |id_#in~x|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and .cse0 (<= 16 |id_#in~x|)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= 14 |id_#t~ret7|)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= 12 |id_#t~ret7|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)))) [2020-10-23 20:27:50,100 INFO L270 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 8 |id_#res|) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and .cse0 (<= 16 |id_#in~x|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret7|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= 14 |id_#t~ret7|) (<= |id_#res| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#t~ret7| 1) (<= |id_#res| 2) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 5 |id_#t~ret7|) (<= |id_#res| 6) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)))) [2020-10-23 20:27:50,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:27:50 BoogieIcfgContainer [2020-10-23 20:27:50,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:27:50,122 INFO L168 Benchmark]: Toolchain (without parser) took 35628.76 ms. Allocated memory was 152.0 MB in the beginning and 316.7 MB in the end (delta: 164.6 MB). Free memory was 128.5 MB in the beginning and 284.3 MB in the end (delta: -155.8 MB). Peak memory consumption was 186.1 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:50,122 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 125.8 MB. Free memory is still 102.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:27:50,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.39 ms. Allocated memory is still 152.0 MB. Free memory was 127.9 MB in the beginning and 118.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:50,124 INFO L168 Benchmark]: Boogie Preprocessor took 48.93 ms. Allocated memory is still 152.0 MB. Free memory was 118.9 MB in the beginning and 117.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:50,124 INFO L168 Benchmark]: RCFGBuilder took 389.83 ms. Allocated memory is still 152.0 MB. Free memory was 117.6 MB in the beginning and 104.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:50,125 INFO L168 Benchmark]: TraceAbstraction took 34830.76 ms. Allocated memory was 152.0 MB in the beginning and 316.7 MB in the end (delta: 164.6 MB). Free memory was 104.4 MB in the beginning and 284.3 MB in the end (delta: -179.9 MB). Peak memory consumption was 162.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:50,128 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 125.8 MB. Free memory is still 102.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 339.39 ms. Allocated memory is still 152.0 MB. Free memory was 127.9 MB in the beginning and 118.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 48.93 ms. Allocated memory is still 152.0 MB. Free memory was 118.9 MB in the beginning and 117.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 389.83 ms. Allocated memory is still 152.0 MB. Free memory was 117.6 MB in the beginning and 104.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 34830.76 ms. Allocated memory was 152.0 MB in the beginning and 316.7 MB in the end (delta: 164.6 MB). Free memory was 104.4 MB in the beginning and 284.3 MB in the end (delta: -179.9 MB). Peak memory consumption was 162.0 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: 11]: Procedure Contract for main Derived contract for procedure main: 15 == input - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id: (((((((((((((((((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1)) || ((((\old(x) <= 11 && 11 <= \old(x)) && \old(x) == x) && \result <= 11) && 11 <= \result)) || ((((\old(x) == x && \old(x) <= 10) && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || (\old(x) == x && 16 <= \old(x))) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || (((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \result <= 15)) || ((((\result <= 14 && 14 <= \old(x)) && \old(x) == x) && 14 <= \result) && \old(x) <= 14)) || ((((12 <= \old(x) && \old(x) == x) && \result <= 12) && \old(x) <= 12) && 12 <= \result)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.2s, OverallIterations: 17, TraceHistogramMax: 17, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 544 SDtfs, 1486 SDslu, 1511 SDs, 0 SdLazy, 5513 SolverSat, 525 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3183 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 245 PreInvPairs, 1229 NumberOfFragments, 1446 HoareAnnotationTreeSize, 245 FomulaSimplifications, 3386 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 37 FomulaSimplificationsInter, 38658 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...