/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 12:20:44,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 12:20:44,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 12:20:44,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 12:20:44,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 12:20:44,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 12:20:44,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 12:20:44,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 12:20:44,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 12:20:44,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 12:20:44,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 12:20:44,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 12:20:44,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 12:20:44,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 12:20:44,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 12:20:44,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 12:20:44,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 12:20:44,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 12:20:44,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 12:20:44,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 12:20:44,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 12:20:44,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 12:20:44,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 12:20:44,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 12:20:44,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 12:20:44,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 12:20:44,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 12:20:44,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 12:20:44,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 12:20:44,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 12:20:44,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 12:20:44,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 12:20:44,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 12:20:44,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 12:20:44,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 12:20:44,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 12:20:44,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 12:20:44,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 12:20:44,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 12:20:44,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 12:20:44,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 12:20:44,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 12:20:44,548 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 12:20:44,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 12:20:44,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 12:20:44,551 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 12:20:44,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 12:20:44,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 12:20:44,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 12:20:44,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 12:20:44,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 12:20:44,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 12:20:44,553 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 12:20:44,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 12:20:44,553 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 12:20:44,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 12:20:44,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 12:20:44,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 12:20:44,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 12:20:44,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 12:20:44,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 12:20:44,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 12:20:44,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 12:20:44,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 12:20:44,555 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 12:20:44,555 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-06 12:20:44,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 12:20:44,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 12:20:44,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 12:20:44,903 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 12:20:44,904 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 12:20:44,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c [2021-05-06 12:20:44,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d13bf96/15943dfb2e27460fb321d3867ae35e1e/FLAG8c1234893 [2021-05-06 12:20:45,362 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 12:20:45,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c [2021-05-06 12:20:45,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d13bf96/15943dfb2e27460fb321d3867ae35e1e/FLAG8c1234893 [2021-05-06 12:20:45,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d13bf96/15943dfb2e27460fb321d3867ae35e1e [2021-05-06 12:20:45,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 12:20:45,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 12:20:45,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 12:20:45,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 12:20:45,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 12:20:45,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:20:45" (1/1) ... [2021-05-06 12:20:45,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149e73eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:45, skipping insertion in model container [2021-05-06 12:20:45,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:20:45" (1/1) ... [2021-05-06 12:20:45,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 12:20:45,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 12:20:45,901 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2021-05-06 12:20:45,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 12:20:45,931 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 12:20:45,962 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2021-05-06 12:20:45,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 12:20:46,014 INFO L208 MainTranslator]: Completed translation [2021-05-06 12:20:46,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46 WrapperNode [2021-05-06 12:20:46,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 12:20:46,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 12:20:46,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 12:20:46,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 12:20:46,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46" (1/1) ... [2021-05-06 12:20:46,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46" (1/1) ... [2021-05-06 12:20:46,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46" (1/1) ... [2021-05-06 12:20:46,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46" (1/1) ... [2021-05-06 12:20:46,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46" (1/1) ... [2021-05-06 12:20:46,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46" (1/1) ... [2021-05-06 12:20:46,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46" (1/1) ... [2021-05-06 12:20:46,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 12:20:46,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 12:20:46,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 12:20:46,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 12:20:46,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46" (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 [2021-05-06 12:20:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 12:20:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 12:20:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 12:20:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 12:20:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 12:20:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2021-05-06 12:20:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2021-05-06 12:20:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure is_pow2 [2021-05-06 12:20:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-05-06 12:20:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 12:20:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-05-06 12:20:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-05-06 12:20:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-05-06 12:20:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 12:20:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 12:20:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 12:20:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 12:20:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 12:20:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 12:20:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 12:20:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2021-05-06 12:20:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 12:20:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 12:20:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2021-05-06 12:20:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure is_pow2 [2021-05-06 12:20:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-05-06 12:20:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 12:20:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-06 12:20:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-05-06 12:20:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 12:20:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 12:20:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 12:20:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 12:20:48,668 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 12:20:48,668 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-05-06 12:20:48,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:20:48 BoogieIcfgContainer [2021-05-06 12:20:48,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 12:20:48,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 12:20:48,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 12:20:48,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 12:20:48,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 12:20:45" (1/3) ... [2021-05-06 12:20:48,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c68f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:20:48, skipping insertion in model container [2021-05-06 12:20:48,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:46" (2/3) ... [2021-05-06 12:20:48,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c68f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:20:48, skipping insertion in model container [2021-05-06 12:20:48,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:20:48" (3/3) ... [2021-05-06 12:20:48,675 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2021-05-06 12:20:48,680 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 12:20:48,682 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 12:20:48,695 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 12:20:48,710 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 12:20:48,710 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 12:20:48,711 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 12:20:48,711 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 12:20:48,711 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 12:20:48,711 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 12:20:48,711 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 12:20:48,711 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 12:20:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-05-06 12:20:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-06 12:20:48,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:48,731 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:48,731 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash 242194828, now seen corresponding path program 1 times [2021-05-06 12:20:48,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:48,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048635930] [2021-05-06 12:20:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:48,801 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:48,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:20:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:20:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:20:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-05-06 12:20:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-06 12:20:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:20:49,133 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:49,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048635930] [2021-05-06 12:20:49,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2048635930] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:49,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:49,136 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 12:20:49,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254011683] [2021-05-06 12:20:49,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 12:20:49,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:49,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 12:20:49,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 12:20:49,153 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:20:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:49,513 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2021-05-06 12:20:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 12:20:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2021-05-06 12:20:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:49,522 INFO L225 Difference]: With dead ends: 127 [2021-05-06 12:20:49,522 INFO L226 Difference]: Without dead ends: 63 [2021-05-06 12:20:49,525 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 116.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-06 12:20:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-06 12:20:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2021-05-06 12:20:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-06 12:20:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2021-05-06 12:20:49,563 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 54 [2021-05-06 12:20:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:49,563 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2021-05-06 12:20:49,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:20:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2021-05-06 12:20:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-06 12:20:49,565 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:49,566 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:49,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 12:20:49,566 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:49,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:49,567 INFO L82 PathProgramCache]: Analyzing trace with hash -73515768, now seen corresponding path program 1 times [2021-05-06 12:20:49,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:49,567 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1937670175] [2021-05-06 12:20:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:49,570 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:20:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:20:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:20:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-05-06 12:20:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-06 12:20:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:20:49,822 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:49,822 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1937670175] [2021-05-06 12:20:49,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1937670175] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:49,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:49,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-06 12:20:49,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219675010] [2021-05-06 12:20:49,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-06 12:20:49,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-06 12:20:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-05-06 12:20:49,824 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:20:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:54,739 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2021-05-06 12:20:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 12:20:54,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2021-05-06 12:20:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:54,741 INFO L225 Difference]: With dead ends: 81 [2021-05-06 12:20:54,741 INFO L226 Difference]: Without dead ends: 65 [2021-05-06 12:20:54,744 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 215.9ms TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-05-06 12:20:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-06 12:20:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2021-05-06 12:20:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-05-06 12:20:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2021-05-06 12:20:54,765 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 54 [2021-05-06 12:20:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:54,765 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2021-05-06 12:20:54,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:20:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2021-05-06 12:20:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-06 12:20:54,770 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:54,771 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:54,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 12:20:54,771 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash -628313814, now seen corresponding path program 1 times [2021-05-06 12:20:54,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:54,772 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [996458549] [2021-05-06 12:20:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:54,774 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:55,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:55,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:55,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:55,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:20:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:55,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:20:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:55,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:20:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:55,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 12:20:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:55,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-05-06 12:20:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-05-06 12:20:55,191 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:55,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [996458549] [2021-05-06 12:20:55,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [996458549] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:55,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:55,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-06 12:20:55,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64296805] [2021-05-06 12:20:55,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-06 12:20:55,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:55,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-06 12:20:55,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-05-06 12:20:55,195 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-05-06 12:20:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:58,564 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2021-05-06 12:20:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-06 12:20:58,573 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 56 [2021-05-06 12:20:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:58,575 INFO L225 Difference]: With dead ends: 81 [2021-05-06 12:20:58,575 INFO L226 Difference]: Without dead ends: 79 [2021-05-06 12:20:58,576 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 767.1ms TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2021-05-06 12:20:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-05-06 12:20:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2021-05-06 12:20:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-05-06 12:20:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2021-05-06 12:20:58,602 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 56 [2021-05-06 12:20:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:58,604 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2021-05-06 12:20:58,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-05-06 12:20:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2021-05-06 12:20:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-06 12:20:58,610 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:58,611 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:58,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 12:20:58,611 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1653895387, now seen corresponding path program 1 times [2021-05-06 12:20:58,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:58,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [963674041] [2021-05-06 12:20:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:58,614 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:58,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:58,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:58,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:58,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:20:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:58,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:20:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:58,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:20:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:58,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 12:20:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:58,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-06 12:20:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:20:58,902 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:58,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [963674041] [2021-05-06 12:20:58,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [963674041] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:58,902 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:58,902 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-06 12:20:58,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957286711] [2021-05-06 12:20:58,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 12:20:58,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:58,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 12:20:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-05-06 12:20:58,904 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:01,928 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2021-05-06 12:21:01,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-06 12:21:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2021-05-06 12:21:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:01,934 INFO L225 Difference]: With dead ends: 110 [2021-05-06 12:21:01,934 INFO L226 Difference]: Without dead ends: 90 [2021-05-06 12:21:01,935 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 537.1ms TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2021-05-06 12:21:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-05-06 12:21:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2021-05-06 12:21:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-05-06 12:21:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2021-05-06 12:21:01,950 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 60 [2021-05-06 12:21:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:01,950 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2021-05-06 12:21:01,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2021-05-06 12:21:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-06 12:21:01,951 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:01,952 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:01,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 12:21:01,952 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2146675487, now seen corresponding path program 1 times [2021-05-06 12:21:01,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:01,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [603057206] [2021-05-06 12:21:01,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:01,954 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 12:21:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-05-06 12:21:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-05-06 12:21:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:02,098 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:02,098 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [603057206] [2021-05-06 12:21:02,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [603057206] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:02,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:02,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-06 12:21:02,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732886738] [2021-05-06 12:21:02,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-06 12:21:02,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:02,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-06 12:21:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-05-06 12:21:02,100 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:21:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:06,941 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2021-05-06 12:21:06,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-06 12:21:06,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 64 [2021-05-06 12:21:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:06,943 INFO L225 Difference]: With dead ends: 114 [2021-05-06 12:21:06,944 INFO L226 Difference]: Without dead ends: 93 [2021-05-06 12:21:06,944 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 226.6ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-05-06 12:21:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-06 12:21:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2021-05-06 12:21:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 65 states have internal predecessors, (73), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-05-06 12:21:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2021-05-06 12:21:06,964 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 64 [2021-05-06 12:21:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:06,965 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2021-05-06 12:21:06,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:21:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2021-05-06 12:21:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-06 12:21:06,968 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:06,969 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:06,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 12:21:06,969 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:06,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:06,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1758641907, now seen corresponding path program 1 times [2021-05-06 12:21:06,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:06,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1889145669] [2021-05-06 12:21:06,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:06,971 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:07,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:07,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:07,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:07,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:07,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:07,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:07,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 12:21:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:07,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-06 12:21:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:07,121 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:07,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1889145669] [2021-05-06 12:21:07,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1889145669] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:07,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:07,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-06 12:21:07,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096175981] [2021-05-06 12:21:07,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-06 12:21:07,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:07,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-06 12:21:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-06 12:21:07,123 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:21:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:16,242 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2021-05-06 12:21:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-06 12:21:16,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2021-05-06 12:21:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:16,244 INFO L225 Difference]: With dead ends: 108 [2021-05-06 12:21:16,244 INFO L226 Difference]: Without dead ends: 86 [2021-05-06 12:21:16,245 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 234.2ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-06 12:21:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-06 12:21:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-05-06 12:21:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-05-06 12:21:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2021-05-06 12:21:16,258 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 63 [2021-05-06 12:21:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:16,259 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2021-05-06 12:21:16,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:21:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2021-05-06 12:21:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-06 12:21:16,260 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:16,260 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:16,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 12:21:16,260 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1958796481, now seen corresponding path program 2 times [2021-05-06 12:21:16,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:16,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1984405314] [2021-05-06 12:21:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:16,263 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-06 12:21:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-06 12:21:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-05-06 12:21:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:16,399 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:16,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1984405314] [2021-05-06 12:21:16,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1984405314] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:16,400 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:16,400 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-06 12:21:16,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120734840] [2021-05-06 12:21:16,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 12:21:16,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:16,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 12:21:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-05-06 12:21:16,401 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:21:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:19,004 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2021-05-06 12:21:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-06 12:21:19,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2021-05-06 12:21:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:19,006 INFO L225 Difference]: With dead ends: 116 [2021-05-06 12:21:19,006 INFO L226 Difference]: Without dead ends: 82 [2021-05-06 12:21:19,009 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 185.2ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-05-06 12:21:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-05-06 12:21:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2021-05-06 12:21:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-05-06 12:21:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2021-05-06 12:21:19,030 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 66 [2021-05-06 12:21:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:19,031 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2021-05-06 12:21:19,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:21:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2021-05-06 12:21:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-06 12:21:19,032 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:19,032 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:19,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 12:21:19,032 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:19,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1560433451, now seen corresponding path program 2 times [2021-05-06 12:21:19,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:19,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [511870169] [2021-05-06 12:21:19,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:19,035 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:19,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:19,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:19,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:19,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:19,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:19,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:19,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-06 12:21:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:19,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-05-06 12:21:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:19,265 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:19,265 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [511870169] [2021-05-06 12:21:19,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [511870169] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:19,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:19,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-06 12:21:19,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646441538] [2021-05-06 12:21:19,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 12:21:19,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:19,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 12:21:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-05-06 12:21:19,267 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:22,075 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2021-05-06 12:21:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 12:21:22,075 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2021-05-06 12:21:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:22,076 INFO L225 Difference]: With dead ends: 107 [2021-05-06 12:21:22,076 INFO L226 Difference]: Without dead ends: 85 [2021-05-06 12:21:22,077 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 356.8ms TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2021-05-06 12:21:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-06 12:21:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2021-05-06 12:21:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 57 states have internal predecessors, (66), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-05-06 12:21:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2021-05-06 12:21:22,087 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 65 [2021-05-06 12:21:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:22,087 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2021-05-06 12:21:22,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2021-05-06 12:21:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-06 12:21:22,088 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:22,088 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:22,088 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-06 12:21:22,088 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1084413588, now seen corresponding path program 1 times [2021-05-06 12:21:22,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:22,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2094882732] [2021-05-06 12:21:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:22,091 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:22,485 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2021-05-06 12:21:22,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:22,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:22,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:22,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:22,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:22,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:22,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-06 12:21:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:22,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-05-06 12:21:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:24,394 WARN L205 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2021-05-06 12:21:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-05-06 12:21:24,458 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:24,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2094882732] [2021-05-06 12:21:24,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2094882732] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:24,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:24,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-06 12:21:24,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301324662] [2021-05-06 12:21:24,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-06 12:21:24,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-06 12:21:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-05-06 12:21:24,460 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 25 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-06 12:21:26,093 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2021-05-06 12:21:26,376 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-05-06 12:21:26,922 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-05-06 12:21:27,121 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-05-06 12:21:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:27,650 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2021-05-06 12:21:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-06 12:21:27,650 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 66 [2021-05-06 12:21:27,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:27,652 INFO L225 Difference]: With dead ends: 122 [2021-05-06 12:21:27,652 INFO L226 Difference]: Without dead ends: 120 [2021-05-06 12:21:27,653 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 3454.6ms TimeCoverageRelationStatistics Valid=296, Invalid=1960, Unknown=0, NotChecked=0, Total=2256 [2021-05-06 12:21:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-05-06 12:21:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2021-05-06 12:21:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2021-05-06 12:21:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2021-05-06 12:21:27,671 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 66 [2021-05-06 12:21:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:27,671 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2021-05-06 12:21:27,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-06 12:21:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2021-05-06 12:21:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-06 12:21:27,672 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:27,672 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:27,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-06 12:21:27,673 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:27,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1470293173, now seen corresponding path program 2 times [2021-05-06 12:21:27,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:27,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1241310491] [2021-05-06 12:21:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:27,675 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:27,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:27,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:27,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:27,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:27,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:27,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:27,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-06 12:21:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:27,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-05-06 12:21:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:27,855 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:27,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1241310491] [2021-05-06 12:21:27,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1241310491] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:27,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:27,855 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-06 12:21:27,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888302724] [2021-05-06 12:21:27,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 12:21:27,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:27,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 12:21:27,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-05-06 12:21:27,857 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:32,934 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2021-05-06 12:21:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-06 12:21:32,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2021-05-06 12:21:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:32,935 INFO L225 Difference]: With dead ends: 127 [2021-05-06 12:21:32,935 INFO L226 Difference]: Without dead ends: 107 [2021-05-06 12:21:32,936 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 366.4ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-05-06 12:21:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-06 12:21:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2021-05-06 12:21:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 78 states have internal predecessors, (91), 17 states have call successors, (17), 11 states have call predecessors, (17), 11 states have return successors, (22), 13 states have call predecessors, (22), 14 states have call successors, (22) [2021-05-06 12:21:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2021-05-06 12:21:32,967 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 67 [2021-05-06 12:21:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:32,967 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2021-05-06 12:21:32,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2021-05-06 12:21:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-06 12:21:32,968 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:32,968 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:32,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-06 12:21:32,969 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:32,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1247511922, now seen corresponding path program 3 times [2021-05-06 12:21:32,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:32,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405821922] [2021-05-06 12:21:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:32,970 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:33,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:33,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:33,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:33,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:33,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:33,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:33,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:21:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:33,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-05-06 12:21:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:33,169 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:33,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405821922] [2021-05-06 12:21:33,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1405821922] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:33,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:33,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-06 12:21:33,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601928330] [2021-05-06 12:21:33,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-06 12:21:33,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:33,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-06 12:21:33,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-05-06 12:21:33,170 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:21:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:36,236 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2021-05-06 12:21:36,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-06 12:21:36,237 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2021-05-06 12:21:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:36,238 INFO L225 Difference]: With dead ends: 169 [2021-05-06 12:21:36,238 INFO L226 Difference]: Without dead ends: 120 [2021-05-06 12:21:36,239 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 516.6ms TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2021-05-06 12:21:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-05-06 12:21:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2021-05-06 12:21:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.2625) internal successors, (101), 85 states have internal predecessors, (101), 16 states have call successors, (16), 11 states have call predecessors, (16), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2021-05-06 12:21:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 136 transitions. [2021-05-06 12:21:36,258 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 136 transitions. Word has length 68 [2021-05-06 12:21:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:36,259 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 136 transitions. [2021-05-06 12:21:36,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:21:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 136 transitions. [2021-05-06 12:21:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-06 12:21:36,260 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:36,260 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:36,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-06 12:21:36,260 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:36,260 INFO L82 PathProgramCache]: Analyzing trace with hash -677053431, now seen corresponding path program 4 times [2021-05-06 12:21:36,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:36,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923365629] [2021-05-06 12:21:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:36,262 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:36,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:36,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:36,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:36,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:36,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:36,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:36,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:21:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:36,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-06 12:21:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:36,412 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:36,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923365629] [2021-05-06 12:21:36,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1923365629] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:36,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:36,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-06 12:21:36,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221257477] [2021-05-06 12:21:36,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-06 12:21:36,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:36,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-06 12:21:36,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-05-06 12:21:36,414 INFO L87 Difference]: Start difference. First operand 109 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:21:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:36,949 INFO L93 Difference]: Finished difference Result 171 states and 215 transitions. [2021-05-06 12:21:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 12:21:36,949 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2021-05-06 12:21:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:36,950 INFO L225 Difference]: With dead ends: 171 [2021-05-06 12:21:36,951 INFO L226 Difference]: Without dead ends: 132 [2021-05-06 12:21:36,951 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 277.3ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-05-06 12:21:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-05-06 12:21:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2021-05-06 12:21:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 88 states have internal predecessors, (106), 16 states have call successors, (16), 11 states have call predecessors, (16), 12 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2021-05-06 12:21:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2021-05-06 12:21:36,969 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 69 [2021-05-06 12:21:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:36,969 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2021-05-06 12:21:36,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:21:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2021-05-06 12:21:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-06 12:21:36,970 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:36,970 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:36,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-06 12:21:36,971 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:36,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:36,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1405616165, now seen corresponding path program 5 times [2021-05-06 12:21:36,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:36,971 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053725036] [2021-05-06 12:21:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:36,972 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:37,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:37,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:37,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:37,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:37,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:37,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:37,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-06 12:21:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:37,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-05-06 12:21:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:37,160 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:37,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053725036] [2021-05-06 12:21:37,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2053725036] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:37,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:37,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-06 12:21:37,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675459830] [2021-05-06 12:21:37,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-06 12:21:37,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-06 12:21:37,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-05-06 12:21:37,162 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:37,993 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2021-05-06 12:21:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 12:21:37,993 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2021-05-06 12:21:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:37,994 INFO L225 Difference]: With dead ends: 138 [2021-05-06 12:21:37,994 INFO L226 Difference]: Without dead ends: 118 [2021-05-06 12:21:37,995 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 443.7ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-05-06 12:21:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-05-06 12:21:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2021-05-06 12:21:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 73 states have internal predecessors, (88), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2021-05-06 12:21:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2021-05-06 12:21:38,010 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 70 [2021-05-06 12:21:38,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:38,011 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2021-05-06 12:21:38,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2021-05-06 12:21:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-06 12:21:38,012 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:38,012 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:38,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-06 12:21:38,012 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash 875388352, now seen corresponding path program 1 times [2021-05-06 12:21:38,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:38,013 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1183616326] [2021-05-06 12:21:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:38,014 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-06 12:21:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-05-06 12:21:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-05-06 12:21:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:38,117 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:38,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1183616326] [2021-05-06 12:21:38,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1183616326] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:38,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:38,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-06 12:21:38,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376057921] [2021-05-06 12:21:38,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-06 12:21:38,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:38,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-06 12:21:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-05-06 12:21:38,118 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:21:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:38,475 INFO L93 Difference]: Finished difference Result 151 states and 186 transitions. [2021-05-06 12:21:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 12:21:38,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2021-05-06 12:21:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:38,476 INFO L225 Difference]: With dead ends: 151 [2021-05-06 12:21:38,476 INFO L226 Difference]: Without dead ends: 98 [2021-05-06 12:21:38,476 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 142.3ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-05-06 12:21:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-06 12:21:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-05-06 12:21:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 75 states have internal predecessors, (89), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2021-05-06 12:21:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2021-05-06 12:21:38,492 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 73 [2021-05-06 12:21:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:38,493 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2021-05-06 12:21:38,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:21:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2021-05-06 12:21:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-06 12:21:38,494 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:38,494 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:38,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-06 12:21:38,494 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:38,495 INFO L82 PathProgramCache]: Analyzing trace with hash -495926943, now seen corresponding path program 1 times [2021-05-06 12:21:38,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:38,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1244820202] [2021-05-06 12:21:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:38,496 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-06 12:21:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-05-06 12:21:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-05-06 12:21:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:38,797 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:38,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1244820202] [2021-05-06 12:21:38,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1244820202] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:38,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:38,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-06 12:21:38,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620359290] [2021-05-06 12:21:38,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 12:21:38,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 12:21:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-05-06 12:21:38,800 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:21:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:41,630 INFO L93 Difference]: Finished difference Result 179 states and 220 transitions. [2021-05-06 12:21:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-06 12:21:41,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2021-05-06 12:21:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:41,632 INFO L225 Difference]: With dead ends: 179 [2021-05-06 12:21:41,632 INFO L226 Difference]: Without dead ends: 120 [2021-05-06 12:21:41,632 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 399.6ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-05-06 12:21:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-05-06 12:21:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2021-05-06 12:21:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 87 states have internal predecessors, (102), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2021-05-06 12:21:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2021-05-06 12:21:41,650 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 74 [2021-05-06 12:21:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:41,651 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2021-05-06 12:21:41,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:21:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2021-05-06 12:21:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-06 12:21:41,651 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:41,652 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:41,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-06 12:21:41,652 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:41,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1541127366, now seen corresponding path program 6 times [2021-05-06 12:21:41,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:41,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1646151373] [2021-05-06 12:21:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:41,654 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:21:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:41,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:21:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:41,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:21:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:41,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:21:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:41,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:21:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:41,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:21:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:41,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:21:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:41,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:21:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:41,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-06 12:21:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:21:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:21:41,906 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:21:41,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1646151373] [2021-05-06 12:21:41,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1646151373] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:21:41,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:21:41,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-06 12:21:41,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922651604] [2021-05-06 12:21:41,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-06 12:21:41,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:21:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-06 12:21:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-05-06 12:21:41,907 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:21:44,999 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2021-05-06 12:21:45,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-06 12:21:45,000 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2021-05-06 12:21:45,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:21:45,001 INFO L225 Difference]: With dead ends: 170 [2021-05-06 12:21:45,001 INFO L226 Difference]: Without dead ends: 148 [2021-05-06 12:21:45,002 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 585.1ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-05-06 12:21:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-05-06 12:21:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2021-05-06 12:21:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 101 states have internal predecessors, (119), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2021-05-06 12:21:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2021-05-06 12:21:45,032 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 73 [2021-05-06 12:21:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:21:45,033 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2021-05-06 12:21:45,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:21:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2021-05-06 12:21:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-06 12:21:45,034 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:21:45,034 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:21:45,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-06 12:21:45,034 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:21:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:21:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1213658525, now seen corresponding path program 1 times [2021-05-06 12:21:45,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:21:45,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1461537539] [2021-05-06 12:21:45,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:21:55,787 WARN L205 SmtUtils]: Spent 10.75 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:22:06,535 WARN L205 SmtUtils]: Spent 10.75 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:22:06,545 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 12:22:06,546 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2021-05-06 12:22:06,547 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:22:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:07,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:22:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:07,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:22:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:07,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:22:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:07,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-05-06 12:22:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:07,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 12:22:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:07,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-06 12:22:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:07,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-05-06 12:22:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:08,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-06 12:22:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:08,841 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2021-05-06 12:22:09,149 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2021-05-06 12:22:09,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-06 12:22:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-05-06 12:22:09,288 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:22:09,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1461537539] [2021-05-06 12:22:09,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1461537539] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:22:09,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:22:09,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-06 12:22:09,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847470935] [2021-05-06 12:22:09,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-06 12:22:09,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:22:09,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-06 12:22:09,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1112, Unknown=0, NotChecked=0, Total=1190 [2021-05-06 12:22:09,289 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand has 35 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 27 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2021-05-06 12:22:12,727 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2021-05-06 12:22:14,565 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 132 [2021-05-06 12:22:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:22:16,052 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2021-05-06 12:22:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-06 12:22:16,052 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 27 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 75 [2021-05-06 12:22:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:22:16,053 INFO L225 Difference]: With dead ends: 159 [2021-05-06 12:22:16,054 INFO L226 Difference]: Without dead ends: 157 [2021-05-06 12:22:16,055 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 4789.4ms TimeCoverageRelationStatistics Valid=279, Invalid=3753, Unknown=0, NotChecked=0, Total=4032 [2021-05-06 12:22:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-06 12:22:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2021-05-06 12:22:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 113 states have internal predecessors, (130), 23 states have call successors, (23), 13 states have call predecessors, (23), 15 states have return successors, (26), 19 states have call predecessors, (26), 19 states have call successors, (26) [2021-05-06 12:22:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2021-05-06 12:22:16,082 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 75 [2021-05-06 12:22:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:22:16,082 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2021-05-06 12:22:16,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 27 states have internal predecessors, (51), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2021-05-06 12:22:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2021-05-06 12:22:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-06 12:22:16,083 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:22:16,083 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:22:16,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-06 12:22:16,084 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:22:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:22:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash -831870690, now seen corresponding path program 2 times [2021-05-06 12:22:16,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:22:16,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084193589] [2021-05-06 12:22:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:22:27,076 WARN L205 SmtUtils]: Spent 10.99 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:22:35,750 WARN L205 SmtUtils]: Spent 8.67 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:22:35,750 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 12:22:35,750 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2021-05-06 12:22:35,751 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:22:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:22:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:22:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:22:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-05-06 12:22:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 12:22:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-06 12:22:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-05-06 12:22:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-05-06 12:22:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-05-06 12:22:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:22:35,929 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:22:35,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084193589] [2021-05-06 12:22:35,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2084193589] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:22:35,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:22:35,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-06 12:22:35,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015497196] [2021-05-06 12:22:35,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-06 12:22:35,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:22:35,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-06 12:22:35,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-05-06 12:22:35,930 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:22:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:22:40,939 INFO L93 Difference]: Finished difference Result 208 states and 256 transitions. [2021-05-06 12:22:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 12:22:40,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2021-05-06 12:22:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:22:40,941 INFO L225 Difference]: With dead ends: 208 [2021-05-06 12:22:40,941 INFO L226 Difference]: Without dead ends: 148 [2021-05-06 12:22:40,942 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 365.8ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-05-06 12:22:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-05-06 12:22:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2021-05-06 12:22:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 112 states have internal predecessors, (130), 22 states have call successors, (22), 13 states have call predecessors, (22), 14 states have return successors, (23), 18 states have call predecessors, (23), 18 states have call successors, (23) [2021-05-06 12:22:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2021-05-06 12:22:40,969 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 76 [2021-05-06 12:22:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:22:40,970 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2021-05-06 12:22:40,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:22:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2021-05-06 12:22:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-06 12:22:40,972 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:22:40,972 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:22:40,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-06 12:22:40,972 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:22:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:22:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1496849804, now seen corresponding path program 7 times [2021-05-06 12:22:40,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:22:40,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [952522180] [2021-05-06 12:22:40,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:22:40,975 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:22:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:41,667 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-05-06 12:22:42,011 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2021-05-06 12:22:42,374 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-05-06 12:22:42,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:22:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:42,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:22:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:42,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:22:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:42,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:22:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:42,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:22:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:42,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:22:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:42,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:22:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:43,340 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2021-05-06 12:22:43,779 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2021-05-06 12:22:44,139 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2021-05-06 12:22:44,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-06 12:22:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:22:54,637 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2021-05-06 12:22:55,197 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 986 DAG size of output: 447 [2021-05-06 12:23:27,817 WARN L205 SmtUtils]: Spent 27.77 s on a formula simplification. DAG size of input: 444 DAG size of output: 154 [2021-05-06 12:23:28,139 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 986 DAG size of output: 446 [2021-05-06 12:23:33,185 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 985 DAG size of output: 445 [2021-05-06 12:23:38,868 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 987 DAG size of output: 446 [2021-05-06 12:23:44,359 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 986 DAG size of output: 445 [2021-05-06 12:23:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-05-06 12:23:49,326 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:23:49,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [952522180] [2021-05-06 12:23:49,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [952522180] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:23:49,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:23:49,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-06 12:23:49,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195103426] [2021-05-06 12:23:49,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-06 12:23:49,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:23:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-06 12:23:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2021-05-06 12:23:49,328 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-06 12:23:57,455 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2021-05-06 12:23:58,756 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-05-06 12:24:02,707 WARN L205 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 226 DAG size of output: 110 [2021-05-06 12:24:06,743 WARN L205 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 270 DAG size of output: 147 [2021-05-06 12:24:13,561 WARN L205 SmtUtils]: Spent 5.44 s on a formula simplification that was a NOOP. DAG size: 184 [2021-05-06 12:24:16,363 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 231 DAG size of output: 115 [2021-05-06 12:24:22,377 WARN L205 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 274 DAG size of output: 151 [2021-05-06 12:24:33,533 WARN L205 SmtUtils]: Spent 9.00 s on a formula simplification that was a NOOP. DAG size: 201 [2021-05-06 12:24:45,899 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-05-06 12:24:46,487 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-05-06 12:24:47,106 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-05-06 12:24:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:24:47,937 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2021-05-06 12:24:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-06 12:24:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 76 [2021-05-06 12:24:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:24:47,939 INFO L225 Difference]: With dead ends: 200 [2021-05-06 12:24:47,939 INFO L226 Difference]: Without dead ends: 198 [2021-05-06 12:24:47,941 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 93477.2ms TimeCoverageRelationStatistics Valid=422, Invalid=3868, Unknown=0, NotChecked=0, Total=4290 [2021-05-06 12:24:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-05-06 12:24:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 169. [2021-05-06 12:24:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 127 states have (on average 1.236220472440945) internal successors, (157), 134 states have internal predecessors, (157), 25 states have call successors, (25), 14 states have call predecessors, (25), 16 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2021-05-06 12:24:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 215 transitions. [2021-05-06 12:24:47,979 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 215 transitions. Word has length 76 [2021-05-06 12:24:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:24:47,979 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 215 transitions. [2021-05-06 12:24:47,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 27 states have internal predecessors, (54), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-06 12:24:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2021-05-06 12:24:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-06 12:24:47,980 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:24:47,980 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:24:47,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-06 12:24:47,981 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:24:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:24:47,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1239460651, now seen corresponding path program 8 times [2021-05-06 12:24:47,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:24:47,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360408517] [2021-05-06 12:24:47,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:24:47,983 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:24:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:48,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:24:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:48,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:24:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:48,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:24:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:48,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:24:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:48,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:24:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:48,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:24:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:48,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:24:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:48,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-06 12:24:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:24:48,157 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:24:48,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360408517] [2021-05-06 12:24:48,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [360408517] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:24:48,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:24:48,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-06 12:24:48,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369069081] [2021-05-06 12:24:48,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-06 12:24:48,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:24:48,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-06 12:24:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-05-06 12:24:48,158 INFO L87 Difference]: Start difference. First operand 169 states and 215 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:24:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:24:51,107 INFO L93 Difference]: Finished difference Result 196 states and 251 transitions. [2021-05-06 12:24:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-06 12:24:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2021-05-06 12:24:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:24:51,109 INFO L225 Difference]: With dead ends: 196 [2021-05-06 12:24:51,109 INFO L226 Difference]: Without dead ends: 184 [2021-05-06 12:24:51,110 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 394.2ms TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2021-05-06 12:24:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-05-06 12:24:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 179. [2021-05-06 12:24:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 143 states have internal predecessors, (168), 26 states have call successors, (26), 14 states have call predecessors, (26), 17 states have return successors, (37), 21 states have call predecessors, (37), 21 states have call successors, (37) [2021-05-06 12:24:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2021-05-06 12:24:51,151 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 77 [2021-05-06 12:24:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:24:51,151 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2021-05-06 12:24:51,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:24:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2021-05-06 12:24:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-06 12:24:51,152 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:24:51,152 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:24:51,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-06 12:24:51,153 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:24:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:24:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1092715177, now seen corresponding path program 9 times [2021-05-06 12:24:51,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:24:51,153 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915863479] [2021-05-06 12:24:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:24:51,154 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:24:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:51,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:24:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:51,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:24:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:51,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:24:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:51,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:24:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:51,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:24:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:51,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:24:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:51,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:24:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:51,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-06 12:24:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:24:51,352 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:24:51,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1915863479] [2021-05-06 12:24:51,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1915863479] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:24:51,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:24:51,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-06 12:24:51,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449833503] [2021-05-06 12:24:51,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 12:24:51,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:24:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 12:24:51,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-05-06 12:24:51,354 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:24:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:24:52,325 INFO L93 Difference]: Finished difference Result 206 states and 265 transitions. [2021-05-06 12:24:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-06 12:24:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2021-05-06 12:24:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:24:52,326 INFO L225 Difference]: With dead ends: 206 [2021-05-06 12:24:52,326 INFO L226 Difference]: Without dead ends: 178 [2021-05-06 12:24:52,327 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 541.5ms TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2021-05-06 12:24:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-05-06 12:24:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2021-05-06 12:24:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 136 states have internal predecessors, (158), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (34), 21 states have call predecessors, (34), 21 states have call successors, (34) [2021-05-06 12:24:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2021-05-06 12:24:52,365 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 77 [2021-05-06 12:24:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:24:52,365 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2021-05-06 12:24:52,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:24:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2021-05-06 12:24:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-06 12:24:52,366 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:24:52,366 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:24:52,366 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-06 12:24:52,366 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:24:52,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:24:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash 873001991, now seen corresponding path program 10 times [2021-05-06 12:24:52,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:24:52,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160026266] [2021-05-06 12:24:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:24:52,368 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:24:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:52,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:24:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:52,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:24:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:52,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:24:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:52,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:24:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:52,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:24:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:52,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:24:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:52,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:24:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:52,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-05-06 12:24:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:24:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:24:52,578 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:24:52,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160026266] [2021-05-06 12:24:52,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [160026266] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:24:52,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:24:52,579 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-06 12:24:52,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131731805] [2021-05-06 12:24:52,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-06 12:24:52,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:24:52,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-06 12:24:52,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-05-06 12:24:52,580 INFO L87 Difference]: Start difference. First operand 172 states and 218 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:24:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:24:53,673 INFO L93 Difference]: Finished difference Result 252 states and 318 transitions. [2021-05-06 12:24:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-06 12:24:53,674 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 77 [2021-05-06 12:24:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:24:53,675 INFO L225 Difference]: With dead ends: 252 [2021-05-06 12:24:53,675 INFO L226 Difference]: Without dead ends: 184 [2021-05-06 12:24:53,676 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 655.6ms TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2021-05-06 12:24:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-05-06 12:24:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2021-05-06 12:24:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 146 states have internal predecessors, (169), 26 states have call successors, (26), 14 states have call predecessors, (26), 17 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) [2021-05-06 12:24:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 230 transitions. [2021-05-06 12:24:53,718 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 230 transitions. Word has length 77 [2021-05-06 12:24:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:24:53,720 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 230 transitions. [2021-05-06 12:24:53,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:24:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 230 transitions. [2021-05-06 12:24:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-06 12:24:53,721 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:24:53,721 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:24:53,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-06 12:24:53,721 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:24:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:24:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1297400883, now seen corresponding path program 3 times [2021-05-06 12:24:53,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:24:53,722 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016213112] [2021-05-06 12:24:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:25:02,335 WARN L205 SmtUtils]: Spent 8.61 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:25:10,945 WARN L205 SmtUtils]: Spent 8.61 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:25:10,946 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 12:25:10,946 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2021-05-06 12:25:10,947 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:25:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:25:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:25:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:25:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-05-06 12:25:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 12:25:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-06 12:25:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-05-06 12:25:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-06 12:25:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-05-06 12:25:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:25:11,515 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:25:11,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016213112] [2021-05-06 12:25:11,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2016213112] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:25:11,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:25:11,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-06 12:25:11,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708584572] [2021-05-06 12:25:11,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-06 12:25:11,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:25:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-06 12:25:11,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-05-06 12:25:11,516 INFO L87 Difference]: Start difference. First operand 182 states and 230 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-05-06 12:25:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:25:12,821 INFO L93 Difference]: Finished difference Result 222 states and 277 transitions. [2021-05-06 12:25:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-06 12:25:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 78 [2021-05-06 12:25:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:25:12,822 INFO L225 Difference]: With dead ends: 222 [2021-05-06 12:25:12,822 INFO L226 Difference]: Without dead ends: 204 [2021-05-06 12:25:12,823 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 980.0ms TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2021-05-06 12:25:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-05-06 12:25:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 182. [2021-05-06 12:25:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 146 states have internal predecessors, (169), 26 states have call successors, (26), 14 states have call predecessors, (26), 17 states have return successors, (33), 21 states have call predecessors, (33), 21 states have call successors, (33) [2021-05-06 12:25:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 228 transitions. [2021-05-06 12:25:12,864 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 228 transitions. Word has length 78 [2021-05-06 12:25:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:25:12,865 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 228 transitions. [2021-05-06 12:25:12,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-05-06 12:25:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 228 transitions. [2021-05-06 12:25:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-06 12:25:12,866 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:25:12,866 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:25:12,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-06 12:25:12,866 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:25:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:25:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2052199378, now seen corresponding path program 11 times [2021-05-06 12:25:12,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:25:12,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1302239506] [2021-05-06 12:25:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:25:12,868 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:25:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:12,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:25:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:12,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:25:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:12,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:25:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:12,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:25:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:12,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:25:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:12,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:25:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:12,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-06 12:25:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:12,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-05-06 12:25:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:25:13,081 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:25:13,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1302239506] [2021-05-06 12:25:13,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1302239506] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:25:13,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:25:13,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-06 12:25:13,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098288099] [2021-05-06 12:25:13,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-06 12:25:13,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:25:13,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-06 12:25:13,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-05-06 12:25:13,082 INFO L87 Difference]: Start difference. First operand 182 states and 228 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:25:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:25:14,017 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2021-05-06 12:25:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-06 12:25:14,018 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2021-05-06 12:25:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:25:14,020 INFO L225 Difference]: With dead ends: 199 [2021-05-06 12:25:14,020 INFO L226 Difference]: Without dead ends: 187 [2021-05-06 12:25:14,020 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 563.0ms TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2021-05-06 12:25:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-05-06 12:25:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 182. [2021-05-06 12:25:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 146 states have internal predecessors, (169), 26 states have call successors, (26), 14 states have call predecessors, (26), 17 states have return successors, (31), 21 states have call predecessors, (31), 21 states have call successors, (31) [2021-05-06 12:25:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2021-05-06 12:25:14,058 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 226 transitions. Word has length 78 [2021-05-06 12:25:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:25:14,058 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 226 transitions. [2021-05-06 12:25:14,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:25:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 226 transitions. [2021-05-06 12:25:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-06 12:25:14,059 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:25:14,060 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:25:14,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-06 12:25:14,060 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:25:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:25:14,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1971107334, now seen corresponding path program 12 times [2021-05-06 12:25:14,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:25:14,060 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2013240395] [2021-05-06 12:25:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:25:14,062 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:25:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:14,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:25:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:14,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:25:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:14,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:25:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:14,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:25:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:14,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:25:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:14,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:25:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:14,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:25:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:14,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-06 12:25:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:25:14,553 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:25:14,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2013240395] [2021-05-06 12:25:14,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2013240395] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:25:14,553 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:25:14,553 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-06 12:25:14,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272398482] [2021-05-06 12:25:14,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-06 12:25:14,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:25:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-06 12:25:14,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-05-06 12:25:14,554 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:25:15,883 INFO L93 Difference]: Finished difference Result 251 states and 312 transitions. [2021-05-06 12:25:15,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-06 12:25:15,884 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2021-05-06 12:25:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:25:15,885 INFO L225 Difference]: With dead ends: 251 [2021-05-06 12:25:15,885 INFO L226 Difference]: Without dead ends: 239 [2021-05-06 12:25:15,886 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 953.5ms TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2021-05-06 12:25:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-05-06 12:25:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 201. [2021-05-06 12:25:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 154 states have (on average 1.2337662337662338) internal successors, (190), 164 states have internal predecessors, (190), 27 states have call successors, (27), 14 states have call predecessors, (27), 19 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2021-05-06 12:25:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2021-05-06 12:25:15,951 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 79 [2021-05-06 12:25:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:25:15,951 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 250 transitions. [2021-05-06 12:25:15,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2021-05-06 12:25:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-06 12:25:15,953 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:25:15,953 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:25:15,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-06 12:25:15,953 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:25:15,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:25:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1406881591, now seen corresponding path program 13 times [2021-05-06 12:25:15,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:25:15,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333750679] [2021-05-06 12:25:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:25:15,955 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:25:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:16,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:25:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:16,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:25:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:16,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:25:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:16,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:25:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:16,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:25:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:16,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:25:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:16,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-06 12:25:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:16,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-05-06 12:25:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:25:16,473 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:25:16,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333750679] [2021-05-06 12:25:16,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [333750679] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:25:16,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:25:16,473 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-06 12:25:16,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699207745] [2021-05-06 12:25:16,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-06 12:25:16,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:25:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-06 12:25:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-05-06 12:25:16,474 INFO L87 Difference]: Start difference. First operand 201 states and 250 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:25:22,094 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2021-05-06 12:25:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-06 12:25:22,095 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2021-05-06 12:25:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:25:22,096 INFO L225 Difference]: With dead ends: 253 [2021-05-06 12:25:22,097 INFO L226 Difference]: Without dead ends: 241 [2021-05-06 12:25:22,097 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 892.2ms TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2021-05-06 12:25:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-05-06 12:25:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 201. [2021-05-06 12:25:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 154 states have (on average 1.2337662337662338) internal successors, (190), 164 states have internal predecessors, (190), 27 states have call successors, (27), 14 states have call predecessors, (27), 19 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2021-05-06 12:25:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2021-05-06 12:25:22,150 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 79 [2021-05-06 12:25:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:25:22,150 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 250 transitions. [2021-05-06 12:25:22,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2021-05-06 12:25:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-06 12:25:22,151 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:25:22,152 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:25:22,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-06 12:25:22,152 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:25:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:25:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1520136901, now seen corresponding path program 14 times [2021-05-06 12:25:22,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:25:22,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1170197343] [2021-05-06 12:25:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:25:22,153 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:25:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:22,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:25:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:22,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:25:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:22,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:25:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:22,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:25:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:22,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:25:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:22,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:25:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:22,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:25:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:22,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-05-06 12:25:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:25:22,373 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:25:22,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1170197343] [2021-05-06 12:25:22,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1170197343] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:25:22,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:25:22,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-06 12:25:22,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011029565] [2021-05-06 12:25:22,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-06 12:25:22,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:25:22,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-06 12:25:22,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-05-06 12:25:22,375 INFO L87 Difference]: Start difference. First operand 201 states and 250 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:25:25,428 INFO L93 Difference]: Finished difference Result 288 states and 358 transitions. [2021-05-06 12:25:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-06 12:25:25,429 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2021-05-06 12:25:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:25:25,430 INFO L225 Difference]: With dead ends: 288 [2021-05-06 12:25:25,430 INFO L226 Difference]: Without dead ends: 213 [2021-05-06 12:25:25,431 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 574.9ms TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2021-05-06 12:25:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-05-06 12:25:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 191. [2021-05-06 12:25:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 154 states have internal predecessors, (178), 27 states have call successors, (27), 14 states have call predecessors, (27), 18 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2021-05-06 12:25:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 237 transitions. [2021-05-06 12:25:25,494 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 237 transitions. Word has length 80 [2021-05-06 12:25:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:25:25,494 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 237 transitions. [2021-05-06 12:25:25,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 237 transitions. [2021-05-06 12:25:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-06 12:25:25,496 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:25:25,496 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:25:25,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-06 12:25:25,496 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:25:25,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:25:25,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1163958224, now seen corresponding path program 15 times [2021-05-06 12:25:25,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:25:25,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221885008] [2021-05-06 12:25:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:25:25,499 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:25:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:25,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:25:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:25,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:25:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:25,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:25:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:25,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:25:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:25,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:25:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:25,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:25:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:25,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-06 12:25:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:25,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-05-06 12:25:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:25:25,819 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:25:25,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221885008] [2021-05-06 12:25:25,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [221885008] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:25:25,819 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:25:25,819 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-06 12:25:25,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499129114] [2021-05-06 12:25:25,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 12:25:25,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:25:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 12:25:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-05-06 12:25:25,820 INFO L87 Difference]: Start difference. First operand 191 states and 237 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:25:26,745 INFO L93 Difference]: Finished difference Result 316 states and 401 transitions. [2021-05-06 12:25:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-06 12:25:26,746 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2021-05-06 12:25:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:25:26,748 INFO L225 Difference]: With dead ends: 316 [2021-05-06 12:25:26,748 INFO L226 Difference]: Without dead ends: 209 [2021-05-06 12:25:26,749 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 544.2ms TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2021-05-06 12:25:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-05-06 12:25:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 195. [2021-05-06 12:25:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 149 states have (on average 1.2281879194630871) internal successors, (183), 158 states have internal predecessors, (183), 27 states have call successors, (27), 14 states have call predecessors, (27), 18 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2021-05-06 12:25:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 242 transitions. [2021-05-06 12:25:26,803 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 242 transitions. Word has length 80 [2021-05-06 12:25:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:25:26,803 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 242 transitions. [2021-05-06 12:25:26,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 242 transitions. [2021-05-06 12:25:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-06 12:25:26,804 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:25:26,804 INFO L523 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:25:26,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-06 12:25:26,805 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:25:26,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:25:26,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1835694648, now seen corresponding path program 16 times [2021-05-06 12:25:26,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:25:26,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100676467] [2021-05-06 12:25:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:25:26,807 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:25:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:26,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:25:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:26,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:25:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:26,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:25:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:26,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 12:25:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:26,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 12:25:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:26,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-06 12:25:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:26,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-06 12:25:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:27,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-05-06 12:25:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:25:27,035 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:25:27,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100676467] [2021-05-06 12:25:27,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [100676467] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:25:27,035 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:25:27,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-06 12:25:27,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187414641] [2021-05-06 12:25:27,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-06 12:25:27,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:25:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-06 12:25:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-05-06 12:25:27,037 INFO L87 Difference]: Start difference. First operand 195 states and 242 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:25:30,119 INFO L93 Difference]: Finished difference Result 266 states and 326 transitions. [2021-05-06 12:25:30,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-06 12:25:30,119 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2021-05-06 12:25:30,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:25:30,121 INFO L225 Difference]: With dead ends: 266 [2021-05-06 12:25:30,121 INFO L226 Difference]: Without dead ends: 201 [2021-05-06 12:25:30,121 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 497.9ms TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-05-06 12:25:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-05-06 12:25:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2021-05-06 12:25:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 139 states have (on average 1.223021582733813) internal successors, (170), 147 states have internal predecessors, (170), 26 states have call successors, (26), 14 states have call predecessors, (26), 17 states have return successors, (27), 21 states have call predecessors, (27), 21 states have call successors, (27) [2021-05-06 12:25:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 223 transitions. [2021-05-06 12:25:30,170 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 223 transitions. Word has length 81 [2021-05-06 12:25:30,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:25:30,170 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 223 transitions. [2021-05-06 12:25:30,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-05-06 12:25:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 223 transitions. [2021-05-06 12:25:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-06 12:25:30,171 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:25:30,171 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:25:30,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-06 12:25:30,171 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:25:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:25:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1323547480, now seen corresponding path program 4 times [2021-05-06 12:25:30,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:25:30,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [521697711] [2021-05-06 12:25:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:25:38,748 WARN L205 SmtUtils]: Spent 8.58 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:25:51,659 WARN L205 SmtUtils]: Spent 12.91 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:25:51,660 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 12:25:51,660 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2021-05-06 12:25:51,674 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:25:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:25:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:25:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:25:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-05-06 12:25:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 12:25:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-06 12:25:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-05-06 12:25:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-06 12:25:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-06 12:25:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-05-06 12:25:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:25:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-05-06 12:25:51,822 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:25:51,822 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [521697711] [2021-05-06 12:25:51,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [521697711] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:25:51,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:25:51,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-06 12:25:51,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604607074] [2021-05-06 12:25:51,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 12:25:51,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:25:51,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 12:25:51,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-05-06 12:25:51,823 INFO L87 Difference]: Start difference. First operand 183 states and 223 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-05-06 12:25:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:25:52,349 INFO L93 Difference]: Finished difference Result 202 states and 244 transitions. [2021-05-06 12:25:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-06 12:25:52,349 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 83 [2021-05-06 12:25:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:25:52,350 INFO L225 Difference]: With dead ends: 202 [2021-05-06 12:25:52,350 INFO L226 Difference]: Without dead ends: 172 [2021-05-06 12:25:52,351 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 253.0ms TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-05-06 12:25:52,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-05-06 12:25:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2021-05-06 12:25:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.2170542635658914) internal successors, (157), 136 states have internal predecessors, (157), 24 states have call successors, (24), 13 states have call predecessors, (24), 15 states have return successors, (24), 19 states have call predecessors, (24), 19 states have call successors, (24) [2021-05-06 12:25:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 205 transitions. [2021-05-06 12:25:52,394 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 205 transitions. Word has length 83 [2021-05-06 12:25:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:25:52,394 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 205 transitions. [2021-05-06 12:25:52,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-05-06 12:25:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 205 transitions. [2021-05-06 12:25:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-06 12:25:52,395 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:25:52,395 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:25:52,396 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-06 12:25:52,396 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:25:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:25:52,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1632278354, now seen corresponding path program 1 times [2021-05-06 12:25:52,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:25:52,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [39170086] [2021-05-06 12:25:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:25:58,839 WARN L205 SmtUtils]: Spent 6.44 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:26:11,749 WARN L205 SmtUtils]: Spent 12.91 s on a formula simplification that was a NOOP. DAG size: 13 [2021-05-06 12:26:11,749 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 12:26:11,750 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2021-05-06 12:26:11,750 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:26:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:26:12,736 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2021-05-06 12:26:14,221 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2021-05-06 12:26:15,538 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-05-06 12:26:15,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:26:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:26:15,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:26:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:26:15,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:26:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:26:15,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-05-06 12:26:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:26:15,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-06 12:26:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:26:15,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-06 12:26:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:26:16,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-05-06 12:26:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:26:17,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-06 12:26:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat