/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/sum_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:43:31,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:43:31,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:43:31,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:43:31,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:43:31,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:43:31,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:43:31,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:43:32,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:43:32,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:43:32,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:43:32,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:43:32,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:43:32,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:43:32,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:43:32,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:43:32,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:43:32,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:43:32,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:43:32,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:43:32,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:43:32,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:43:32,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:43:32,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:43:32,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:43:32,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:43:32,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:43:32,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:43:32,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:43:32,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:43:32,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:43:32,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:43:32,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:43:32,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:43:32,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:43:32,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:43:32,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:43:32,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:43:32,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:43:32,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:43:32,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:43:32,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:43:32,107 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:43:32,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:43:32,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:43:32,113 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:43:32,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:43:32,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:43:32,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:43:32,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:43:32,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:43:32,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:43:32,116 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:43:32,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:43:32,116 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:43:32,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:43:32,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:43:32,117 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:43:32,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:43:32,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:43:32,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:43:32,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:43:32,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:43:32,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:43:32,119 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:43:32,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:43:32,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:43:32,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:43:32,594 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:43:32,595 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:43:32,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-11-07 00:43:32,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7158dc9/ae88d2fa9abc41e8aed6150cbf1801d8/FLAG0b8661949 [2020-11-07 00:43:33,321 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:43:33,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-11-07 00:43:33,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7158dc9/ae88d2fa9abc41e8aed6150cbf1801d8/FLAG0b8661949 [2020-11-07 00:43:33,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7158dc9/ae88d2fa9abc41e8aed6150cbf1801d8 [2020-11-07 00:43:33,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:43:33,696 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:43:33,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:33,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:43:33,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:43:33,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:33" (1/1) ... [2020-11-07 00:43:33,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204c7763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33, skipping insertion in model container [2020-11-07 00:43:33,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:33" (1/1) ... [2020-11-07 00:43:33,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:43:33,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:43:33,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:33,902 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:43:33,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:33,939 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:43:33,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33 WrapperNode [2020-11-07 00:43:33,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:33,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:43:33,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:43:33,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:43:33,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33" (1/1) ... [2020-11-07 00:43:33,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33" (1/1) ... [2020-11-07 00:43:33,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33" (1/1) ... [2020-11-07 00:43:33,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33" (1/1) ... [2020-11-07 00:43:33,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33" (1/1) ... [2020-11-07 00:43:33,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33" (1/1) ... [2020-11-07 00:43:33,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33" (1/1) ... [2020-11-07 00:43:33,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:43:33,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:43:33,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:43:33,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:43:33,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:43:34,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:43:34,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:43:34,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:43:34,066 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-11-07 00:43:34,066 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:43:34,067 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:43:34,067 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:43:34,067 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:43:34,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:43:34,067 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-11-07 00:43:34,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:43:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:43:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:43:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:43:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:43:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:43:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:43:34,588 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:43:34,589 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:43:34,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:34 BoogieIcfgContainer [2020-11-07 00:43:34,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:43:34,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:43:34,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:43:34,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:43:34,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:43:33" (1/3) ... [2020-11-07 00:43:34,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4651f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:34, skipping insertion in model container [2020-11-07 00:43:34,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:33" (2/3) ... [2020-11-07 00:43:34,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4651f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:34, skipping insertion in model container [2020-11-07 00:43:34,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:34" (3/3) ... [2020-11-07 00:43:34,611 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2020-11-07 00:43:34,688 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:43:34,692 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:43:34,711 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:43:34,749 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:43:34,749 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:43:34,749 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:43:34,749 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:43:34,750 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:43:34,750 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:43:34,750 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:43:34,750 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:43:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-11-07 00:43:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 00:43:34,784 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:34,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:34,786 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:34,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-11-07 00:43:34,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:34,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684229928] [2020-11-07 00:43:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:34,913 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:43:35,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [684229928] [2020-11-07 00:43:35,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:35,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:43:35,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251144693] [2020-11-07 00:43:35,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:43:35,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:35,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:43:35,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:43:35,391 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-11-07 00:43:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:35,756 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 00:43:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:43:35,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 00:43:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:35,769 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:43:35,770 INFO L226 Difference]: Without dead ends: 34 [2020-11-07 00:43:35,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:43:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-07 00:43:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-07 00:43:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-07 00:43:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-11-07 00:43:35,913 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-11-07 00:43:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:35,914 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-11-07 00:43:35,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:43:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-11-07 00:43:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 00:43:35,919 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:35,920 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:35,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:43:35,920 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-11-07 00:43:35,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:35,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [738566952] [2020-11-07 00:43:35,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:35,935 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-07 00:43:36,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [738566952] [2020-11-07 00:43:36,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:36,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:43:36,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051370531] [2020-11-07 00:43:36,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:43:36,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:43:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:43:36,190 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-11-07 00:43:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:36,493 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-11-07 00:43:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:43:36,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-11-07 00:43:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:36,496 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:43:36,496 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:43:36,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:43:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:43:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:43:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:43:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-11-07 00:43:36,517 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-11-07 00:43:36,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:36,517 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-07 00:43:36,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:43:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-11-07 00:43:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 00:43:36,519 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:36,520 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:36,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:43:36,520 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-11-07 00:43:36,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:36,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1827865703] [2020-11-07 00:43:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:36,525 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:43:36,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1827865703] [2020-11-07 00:43:36,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:36,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:43:36,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817855700] [2020-11-07 00:43:36,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:43:36,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:43:36,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:43:36,727 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-11-07 00:43:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:37,096 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-11-07 00:43:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:43:37,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-11-07 00:43:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:37,099 INFO L225 Difference]: With dead ends: 51 [2020-11-07 00:43:37,099 INFO L226 Difference]: Without dead ends: 44 [2020-11-07 00:43:37,100 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-11-07 00:43:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-07 00:43:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-07 00:43:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-07 00:43:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-11-07 00:43:37,117 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-11-07 00:43:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:37,118 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-11-07 00:43:37,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:43:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-11-07 00:43:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 00:43:37,120 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:37,121 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 1] [2020-11-07 00:43:37,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:43:37,121 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:37,122 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-11-07 00:43:37,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:37,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565012717] [2020-11-07 00:43:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:37,126 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-07 00:43:37,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565012717] [2020-11-07 00:43:37,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:37,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:43:37,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718435296] [2020-11-07 00:43:37,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:43:37,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:37,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:43:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:43:37,401 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-11-07 00:43:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:37,815 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-11-07 00:43:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:43:37,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-11-07 00:43:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:37,817 INFO L225 Difference]: With dead ends: 56 [2020-11-07 00:43:37,817 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 00:43:37,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:43:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 00:43:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-11-07 00:43:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 00:43:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-11-07 00:43:37,833 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-11-07 00:43:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:37,834 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-11-07 00:43:37,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:43:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-11-07 00:43:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:43:37,836 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:37,836 INFO L422 BasicCegarLoop]: trace histogram [5, 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, 1] [2020-11-07 00:43:37,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:43:37,837 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:37,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-11-07 00:43:37,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:37,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1074120830] [2020-11-07 00:43:37,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:37,840 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-07 00:43:38,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1074120830] [2020-11-07 00:43:38,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:38,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:43:38,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014074562] [2020-11-07 00:43:38,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:43:38,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:43:38,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:43:38,060 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-11-07 00:43:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:38,550 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-11-07 00:43:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:43:38,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-11-07 00:43:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:38,553 INFO L225 Difference]: With dead ends: 61 [2020-11-07 00:43:38,553 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 00:43:38,555 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-11-07 00:43:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 00:43:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-07 00:43:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 00:43:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-11-07 00:43:38,585 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-11-07 00:43:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:38,585 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-11-07 00:43:38,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:43:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-11-07 00:43:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:43:38,591 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:38,592 INFO L422 BasicCegarLoop]: trace histogram [6, 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, 1] [2020-11-07 00:43:38,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:43:38,598 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:38,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:38,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-11-07 00:43:38,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:38,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209997744] [2020-11-07 00:43:38,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:38,602 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-11-07 00:43:38,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209997744] [2020-11-07 00:43:38,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:38,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:43:38,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363770610] [2020-11-07 00:43:38,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:43:38,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:38,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:43:38,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:43:38,896 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-11-07 00:43:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:39,401 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-11-07 00:43:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:43:39,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-11-07 00:43:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:39,403 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:43:39,403 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:43:39,404 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-11-07 00:43:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:43:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:43:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:43:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-07 00:43:39,420 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-11-07 00:43:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:39,421 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-07 00:43:39,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:43:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-07 00:43:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:43:39,423 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:39,423 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 1] [2020-11-07 00:43:39,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:43:39,423 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:39,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:39,424 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-11-07 00:43:39,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:39,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1502467117] [2020-11-07 00:43:39,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:39,427 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-11-07 00:43:39,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1502467117] [2020-11-07 00:43:39,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:39,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:43:39,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189415368] [2020-11-07 00:43:39,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:43:39,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:39,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:43:39,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:43:39,768 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-11-07 00:43:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:40,344 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-11-07 00:43:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:43:40,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-11-07 00:43:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:40,350 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:43:40,350 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 00:43:40,351 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-11-07 00:43:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 00:43:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-07 00:43:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 00:43:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-11-07 00:43:40,384 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-11-07 00:43:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:40,387 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-11-07 00:43:40,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:43:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-11-07 00:43:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 00:43:40,391 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:40,392 INFO L422 BasicCegarLoop]: trace histogram [8, 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, 1] [2020-11-07 00:43:40,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:43:40,392 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:40,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-11-07 00:43:40,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:40,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599535303] [2020-11-07 00:43:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:40,402 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-11-07 00:43:40,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599535303] [2020-11-07 00:43:40,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:40,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:43:40,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75206150] [2020-11-07 00:43:40,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:43:40,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:43:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:43:40,794 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-11-07 00:43:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:41,388 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-11-07 00:43:41,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:43:41,389 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-11-07 00:43:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:41,390 INFO L225 Difference]: With dead ends: 76 [2020-11-07 00:43:41,390 INFO L226 Difference]: Without dead ends: 69 [2020-11-07 00:43:41,392 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-11-07 00:43:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-07 00:43:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-07 00:43:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 00:43:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-11-07 00:43:41,406 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-11-07 00:43:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:41,407 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-11-07 00:43:41,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:43:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-11-07 00:43:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 00:43:41,408 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:41,409 INFO L422 BasicCegarLoop]: trace histogram [9, 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, 1] [2020-11-07 00:43:41,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:43:41,409 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-11-07 00:43:41,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:41,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [182004212] [2020-11-07 00:43:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:41,412 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-07 00:43:41,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [182004212] [2020-11-07 00:43:41,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:41,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:43:41,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753959458] [2020-11-07 00:43:41,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:43:41,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:43:41,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:43:41,779 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-11-07 00:43:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:42,437 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-11-07 00:43:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:43:42,438 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-11-07 00:43:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:42,439 INFO L225 Difference]: With dead ends: 81 [2020-11-07 00:43:42,439 INFO L226 Difference]: Without dead ends: 74 [2020-11-07 00:43:42,440 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-11-07 00:43:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-07 00:43:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-07 00:43:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 00:43:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-11-07 00:43:42,455 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-11-07 00:43:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:42,456 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-11-07 00:43:42,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:43:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-11-07 00:43:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 00:43:42,457 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:42,457 INFO L422 BasicCegarLoop]: trace histogram [10, 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, 1] [2020-11-07 00:43:42,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:43:42,458 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:42,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:42,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-11-07 00:43:42,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:42,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1560097901] [2020-11-07 00:43:42,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:42,461 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-11-07 00:43:42,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1560097901] [2020-11-07 00:43:42,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:42,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:43:42,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665840520] [2020-11-07 00:43:42,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:43:42,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:42,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:43:42,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:43:42,858 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-11-07 00:43:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:43,572 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-11-07 00:43:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:43:43,572 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-11-07 00:43:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:43,574 INFO L225 Difference]: With dead ends: 86 [2020-11-07 00:43:43,574 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:43:43,575 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-11-07 00:43:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:43:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:43:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:43:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-11-07 00:43:43,591 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-11-07 00:43:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:43,591 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-11-07 00:43:43,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:43:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-11-07 00:43:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 00:43:43,593 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:43,593 INFO L422 BasicCegarLoop]: trace histogram [11, 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, 1] [2020-11-07 00:43:43,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:43:43,593 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:43,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-11-07 00:43:43,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:43,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [937185359] [2020-11-07 00:43:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:43,596 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-11-07 00:43:44,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [937185359] [2020-11-07 00:43:44,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:44,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:43:44,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583357297] [2020-11-07 00:43:44,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:43:44,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:44,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:43:44,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:43:44,070 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-11-07 00:43:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:44,834 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-11-07 00:43:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:43:44,834 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-11-07 00:43:44,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:44,836 INFO L225 Difference]: With dead ends: 91 [2020-11-07 00:43:44,836 INFO L226 Difference]: Without dead ends: 84 [2020-11-07 00:43:44,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:43:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-07 00:43:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-07 00:43:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-07 00:43:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-11-07 00:43:44,869 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-11-07 00:43:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:44,869 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-11-07 00:43:44,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:43:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-11-07 00:43:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-07 00:43:44,873 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:44,874 INFO L422 BasicCegarLoop]: trace histogram [12, 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, 1] [2020-11-07 00:43:44,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:43:44,874 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:44,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-11-07 00:43:44,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:44,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911729023] [2020-11-07 00:43:44,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:44,880 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:44,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:44,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-11-07 00:43:45,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [911729023] [2020-11-07 00:43:45,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:45,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:43:45,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118011300] [2020-11-07 00:43:45,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:43:45,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:45,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:43:45,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:43:45,475 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-11-07 00:43:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:46,271 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-11-07 00:43:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:43:46,272 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-11-07 00:43:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:46,274 INFO L225 Difference]: With dead ends: 96 [2020-11-07 00:43:46,274 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:43:46,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-11-07 00:43:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:43:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-11-07 00:43:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-07 00:43:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-11-07 00:43:46,293 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-11-07 00:43:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:46,293 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-11-07 00:43:46,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:43:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-11-07 00:43:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-07 00:43:46,295 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:46,295 INFO L422 BasicCegarLoop]: trace histogram [13, 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, 1] [2020-11-07 00:43:46,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:43:46,296 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-11-07 00:43:46,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:46,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1086616715] [2020-11-07 00:43:46,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:46,299 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-11-07 00:43:46,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1086616715] [2020-11-07 00:43:46,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:46,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:43:46,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643124143] [2020-11-07 00:43:46,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:43:46,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:46,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:43:46,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:43:46,896 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-11-07 00:43:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:47,712 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-11-07 00:43:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 00:43:47,712 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-11-07 00:43:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:47,714 INFO L225 Difference]: With dead ends: 101 [2020-11-07 00:43:47,715 INFO L226 Difference]: Without dead ends: 94 [2020-11-07 00:43:47,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 00:43:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-07 00:43:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-11-07 00:43:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-07 00:43:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-11-07 00:43:47,731 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-11-07 00:43:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:47,731 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-11-07 00:43:47,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:43:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-11-07 00:43:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 00:43:47,733 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:47,733 INFO L422 BasicCegarLoop]: trace histogram [14, 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, 1] [2020-11-07 00:43:47,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:43:47,734 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-11-07 00:43:47,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:47,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [960975388] [2020-11-07 00:43:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:47,738 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:47,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:47,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:47,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:47,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:47,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:47,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-11-07 00:43:48,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [960975388] [2020-11-07 00:43:48,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:48,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-07 00:43:48,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185106383] [2020-11-07 00:43:48,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 00:43:48,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 00:43:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:43:48,482 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-11-07 00:43:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:49,353 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-11-07 00:43:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:43:49,354 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-11-07 00:43:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:49,358 INFO L225 Difference]: With dead ends: 106 [2020-11-07 00:43:49,358 INFO L226 Difference]: Without dead ends: 99 [2020-11-07 00:43:49,361 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-11-07 00:43:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-07 00:43:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-11-07 00:43:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-07 00:43:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-11-07 00:43:49,379 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-11-07 00:43:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:49,379 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-11-07 00:43:49,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 00:43:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-11-07 00:43:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 00:43:49,381 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:49,381 INFO L422 BasicCegarLoop]: trace histogram [15, 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, 1] [2020-11-07 00:43:49,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:43:49,382 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-11-07 00:43:49,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:49,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1029521413] [2020-11-07 00:43:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:49,386 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:49,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:50,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:50,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-11-07 00:43:50,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1029521413] [2020-11-07 00:43:50,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:50,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-07 00:43:50,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791630076] [2020-11-07 00:43:50,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 00:43:50,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:50,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 00:43:50,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:43:50,218 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-11-07 00:43:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:51,186 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-11-07 00:43:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 00:43:51,187 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-11-07 00:43:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:51,189 INFO L225 Difference]: With dead ends: 111 [2020-11-07 00:43:51,189 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 00:43:51,191 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-11-07 00:43:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 00:43:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-11-07 00:43:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-07 00:43:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-11-07 00:43:51,205 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-11-07 00:43:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:51,206 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-11-07 00:43:51,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 00:43:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-11-07 00:43:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-11-07 00:43:51,208 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:51,208 INFO L422 BasicCegarLoop]: trace histogram [16, 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, 1] [2020-11-07 00:43:51,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:43:51,208 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:51,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:51,209 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-11-07 00:43:51,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:51,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [583698720] [2020-11-07 00:43:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:51,211 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-11-07 00:43:51,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [583698720] [2020-11-07 00:43:51,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:51,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-07 00:43:51,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937791186] [2020-11-07 00:43:51,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 00:43:51,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 00:43:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:43:52,000 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2020-11-07 00:43:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:53,036 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-11-07 00:43:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 00:43:53,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-11-07 00:43:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:53,038 INFO L225 Difference]: With dead ends: 116 [2020-11-07 00:43:53,038 INFO L226 Difference]: Without dead ends: 109 [2020-11-07 00:43:53,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 00:43:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-07 00:43:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-11-07 00:43:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-07 00:43:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2020-11-07 00:43:53,054 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 162 [2020-11-07 00:43:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:53,054 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2020-11-07 00:43:53,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 00:43:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2020-11-07 00:43:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-11-07 00:43:53,056 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:53,057 INFO L422 BasicCegarLoop]: trace histogram [17, 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, 1] [2020-11-07 00:43:53,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:43:53,057 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1851147437, now seen corresponding path program 16 times [2020-11-07 00:43:53,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:53,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [464515225] [2020-11-07 00:43:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:53,060 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-11-07 00:43:53,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [464515225] [2020-11-07 00:43:53,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:53,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-11-07 00:43:53,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512236789] [2020-11-07 00:43:53,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 00:43:53,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 00:43:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-11-07 00:43:53,918 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 22 states. [2020-11-07 00:43:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:55,021 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-11-07 00:43:55,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:43:55,022 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-11-07 00:43:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:55,025 INFO L225 Difference]: With dead ends: 121 [2020-11-07 00:43:55,025 INFO L226 Difference]: Without dead ends: 114 [2020-11-07 00:43:55,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 00:43:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-11-07 00:43:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-11-07 00:43:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-07 00:43:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2020-11-07 00:43:55,040 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 171 [2020-11-07 00:43:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:55,041 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2020-11-07 00:43:55,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 00:43:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2020-11-07 00:43:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-07 00:43:55,043 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:55,044 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:55,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:43:55,044 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash -383495636, now seen corresponding path program 17 times [2020-11-07 00:43:55,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:55,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720952409] [2020-11-07 00:43:55,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:55,047 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:55,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-11-07 00:43:56,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720952409] [2020-11-07 00:43:56,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:56,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-07 00:43:56,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344949656] [2020-11-07 00:43:56,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 00:43:56,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:56,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 00:43:56,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:43:56,011 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 23 states. [2020-11-07 00:43:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:57,236 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-11-07 00:43:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:43:57,237 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-11-07 00:43:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:57,239 INFO L225 Difference]: With dead ends: 126 [2020-11-07 00:43:57,240 INFO L226 Difference]: Without dead ends: 119 [2020-11-07 00:43:57,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 00:43:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-07 00:43:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-11-07 00:43:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-07 00:43:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2020-11-07 00:43:57,259 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 180 [2020-11-07 00:43:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:57,260 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2020-11-07 00:43:57,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 00:43:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2020-11-07 00:43:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-11-07 00:43:57,263 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:57,263 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:57,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 00:43:57,264 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:57,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:57,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1621618269, now seen corresponding path program 18 times [2020-11-07 00:43:57,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:57,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [13879101] [2020-11-07 00:43:57,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:57,268 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:57,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:58,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:58,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:58,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:58,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:58,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:58,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-11-07 00:43:58,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [13879101] [2020-11-07 00:43:58,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:58,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-11-07 00:43:58,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25907002] [2020-11-07 00:43:58,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 00:43:58,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:58,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 00:43:58,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:43:58,461 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 24 states. [2020-11-07 00:43:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:59,794 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-11-07 00:43:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 00:43:59,795 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-11-07 00:43:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:59,797 INFO L225 Difference]: With dead ends: 131 [2020-11-07 00:43:59,797 INFO L226 Difference]: Without dead ends: 124 [2020-11-07 00:43:59,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 00:43:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-11-07 00:43:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-11-07 00:43:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:43:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2020-11-07 00:43:59,813 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 189 [2020-11-07 00:43:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:59,814 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2020-11-07 00:43:59,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 00:43:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2020-11-07 00:43:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-07 00:43:59,815 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:59,815 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:59,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 00:43:59,816 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:59,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1138628534, now seen corresponding path program 19 times [2020-11-07 00:43:59,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:59,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1555342160] [2020-11-07 00:43:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:59,819 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:59,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:59,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:59,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-11-07 00:44:01,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1555342160] [2020-11-07 00:44:01,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:01,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-07 00:44:01,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316362534] [2020-11-07 00:44:01,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 00:44:01,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:01,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 00:44:01,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:44:01,030 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 25 states. [2020-11-07 00:44:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:02,463 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-11-07 00:44:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 00:44:02,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-11-07 00:44:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:02,465 INFO L225 Difference]: With dead ends: 136 [2020-11-07 00:44:02,465 INFO L226 Difference]: Without dead ends: 129 [2020-11-07 00:44:02,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 00:44:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-07 00:44:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-11-07 00:44:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-07 00:44:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2020-11-07 00:44:02,483 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 198 [2020-11-07 00:44:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:02,483 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2020-11-07 00:44:02,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 00:44:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2020-11-07 00:44:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-11-07 00:44:02,485 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:02,485 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:02,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 00:44:02,485 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -223075943, now seen corresponding path program 20 times [2020-11-07 00:44:02,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:02,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1306491184] [2020-11-07 00:44:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:02,489 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:44:02,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:44:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:44:02,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:44:02,662 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:44:02,662 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:44:02,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 00:44:02,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:44:02 BoogieIcfgContainer [2020-11-07 00:44:02,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:44:02,691 INFO L168 Benchmark]: Toolchain (without parser) took 28999.77 ms. Allocated memory was 151.0 MB in the beginning and 483.4 MB in the end (delta: 332.4 MB). Free memory was 128.0 MB in the beginning and 287.3 MB in the end (delta: -159.3 MB). Peak memory consumption was 174.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:02,692 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 124.4 MB in the end (delta: 131.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:44:02,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.50 ms. Allocated memory is still 151.0 MB. Free memory was 127.4 MB in the beginning and 117.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:02,693 INFO L168 Benchmark]: Boogie Preprocessor took 36.29 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 116.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:02,694 INFO L168 Benchmark]: RCFGBuilder took 614.96 ms. Allocated memory is still 151.0 MB. Free memory was 116.5 MB in the beginning and 103.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:02,694 INFO L168 Benchmark]: TraceAbstraction took 28091.74 ms. Allocated memory was 151.0 MB in the beginning and 483.4 MB in the end (delta: 332.4 MB). Free memory was 102.7 MB in the beginning and 287.3 MB in the end (delta: -184.6 MB). Peak memory consumption was 148.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:02,697 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.26 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 124.4 MB in the end (delta: 131.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 240.50 ms. Allocated memory is still 151.0 MB. Free memory was 127.4 MB in the beginning and 117.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.29 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 116.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 614.96 ms. Allocated memory is still 151.0 MB. Free memory was 116.5 MB in the beginning and 103.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28091.74 ms. Allocated memory was 151.0 MB in the beginning and 483.4 MB in the end (delta: 332.4 MB). Free memory was 102.7 MB in the beginning and 287.3 MB in the end (delta: -184.6 MB). Peak memory consumption was 148.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int a = 20; [L15] int b = 0; [L16] CALL, EXPR sum(a, b) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND TRUE n <= 0 [L7] return m + n; [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] CALL reach_error() [L3] __assert_fail("0", "sum_20x0-1.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.9s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 543 SDtfs, 2137 SDslu, 1218 SDs, 0 SdLazy, 2367 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 980 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...