./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_relative_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_relative_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4fce72e4c86270281dd05ead367908aebeea58cd11d1d4da51b0e6a5af67a67d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:18:19,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:18:19,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:18:19,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:18:19,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:18:19,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:18:19,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:18:19,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:18:19,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:18:19,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:18:19,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:18:19,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:18:19,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:18:19,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:18:19,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:18:19,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:18:19,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:18:19,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:18:19,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:18:19,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:18:19,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:18:19,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:18:19,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:18:19,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:18:19,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:18:19,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:18:19,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:18:19,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:18:19,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:18:19,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:18:19,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:18:19,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:18:19,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:18:19,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:18:19,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:18:19,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:18:19,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:18:19,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:18:19,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:18:19,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:18:19,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:18:19,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 10:18:19,449 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:18:19,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:18:19,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:18:19,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:18:19,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:18:19,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:18:19,451 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:18:19,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:18:19,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:18:19,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:18:19,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:18:19,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:18:19,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:18:19,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:18:19,453 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:18:19,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:18:19,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:18:19,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:18:19,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:18:19,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:18:19,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:18:19,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:18:19,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:18:19,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:18:19,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:18:19,454 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:18:19,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:18:19,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:18:19,455 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:18:19,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fce72e4c86270281dd05ead367908aebeea58cd11d1d4da51b0e6a5af67a67d [2021-11-06 10:18:19,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:18:19,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:18:19,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:18:19,660 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:18:19,661 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:18:19,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_relative_harness.i [2021-11-06 10:18:19,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8ff9a05/d72cf72196e349109e133936bb7601c9/FLAG48eb11e30 [2021-11-06 10:18:20,272 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:18:20,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_relative_harness.i [2021-11-06 10:18:20,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8ff9a05/d72cf72196e349109e133936bb7601c9/FLAG48eb11e30 [2021-11-06 10:18:20,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8ff9a05/d72cf72196e349109e133936bb7601c9 [2021-11-06 10:18:20,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:18:20,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:18:20,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:18:20,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:18:20,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:18:20,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:20" (1/1) ... [2021-11-06 10:18:20,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b968ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:20, skipping insertion in model container [2021-11-06 10:18:20,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:20" (1/1) ... [2021-11-06 10:18:20,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:18:20,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:18:21,030 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_relative_harness.i[4503,4516] [2021-11-06 10:18:21,037 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_relative_harness.i[4563,4576] [2021-11-06 10:18:21,059 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:18:21,067 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:18:21,585 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,588 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,589 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,608 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,610 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,613 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,614 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,814 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:18:21,815 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:18:21,816 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:18:21,817 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:18:21,819 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:18:21,820 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:18:21,820 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:18:21,821 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:18:21,823 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:18:21,824 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:18:21,920 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:18:21,926 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,926 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,984 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:21,984 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:18:22,053 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:18:22,064 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_relative_harness.i[4503,4516] [2021-11-06 10:18:22,065 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_relative_harness.i[4563,4576] [2021-11-06 10:18:22,066 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:18:22,066 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:18:22,085 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,085 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,086 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,086 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,086 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,090 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,090 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,091 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,091 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,108 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:18:22,109 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:18:22,109 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:18:22,110 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:18:22,110 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:18:22,111 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:18:22,111 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:18:22,111 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:18:22,112 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:18:22,112 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:18:22,123 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:18:22,126 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,127 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,174 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,175 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:18:22,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:18:22,344 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:18:22,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22 WrapperNode [2021-11-06 10:18:22,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:18:22,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:18:22,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:18:22,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:18:22,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:18:22,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:18:22,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:18:22,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:18:22,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:18:22,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:18:22,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:18:22,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:18:22,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (1/1) ... [2021-11-06 10:18:22,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:18:22,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:18:22,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 10:18:22,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 10:18:22,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:18:22,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:18:22,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:18:22,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:18:22,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:18:22,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:18:22,692 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-06 10:18:22,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:18:22,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:18:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:18:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:18:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:18:30,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:18:30,588 INFO L299 CfgBuilder]: Removed 118 assume(true) statements. [2021-11-06 10:18:30,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:30 BoogieIcfgContainer [2021-11-06 10:18:30,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:18:30,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:18:30,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:18:30,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:18:30,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:18:20" (1/3) ... [2021-11-06 10:18:30,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fde591b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:30, skipping insertion in model container [2021-11-06 10:18:30,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:22" (2/3) ... [2021-11-06 10:18:30,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fde591b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:30, skipping insertion in model container [2021-11-06 10:18:30,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:30" (3/3) ... [2021-11-06 10:18:30,599 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reserve_relative_harness.i [2021-11-06 10:18:30,605 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:18:30,605 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-06 10:18:30,642 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:18:30,646 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 10:18:30,646 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-06 10:18:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 224 states have (on average 1.4642857142857142) internal successors, (328), 231 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-06 10:18:30,671 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:30,672 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:30,672 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash -473287577, now seen corresponding path program 1 times [2021-11-06 10:18:30,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:30,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144893105] [2021-11-06 10:18:30,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:30,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:31,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:31,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144893105] [2021-11-06 10:18:31,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144893105] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:31,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:31,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 10:18:31,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133752475] [2021-11-06 10:18:31,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 10:18:31,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:31,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 10:18:31,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:18:31,213 INFO L87 Difference]: Start difference. First operand has 232 states, 224 states have (on average 1.4642857142857142) internal successors, (328), 231 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:31,245 INFO L93 Difference]: Finished difference Result 457 states and 647 transitions. [2021-11-06 10:18:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 10:18:31,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-06 10:18:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:31,255 INFO L225 Difference]: With dead ends: 457 [2021-11-06 10:18:31,255 INFO L226 Difference]: Without dead ends: 227 [2021-11-06 10:18:31,257 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:18:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-06 10:18:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-11-06 10:18:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.3681818181818182) internal successors, (301), 226 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 301 transitions. [2021-11-06 10:18:31,313 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 301 transitions. Word has length 22 [2021-11-06 10:18:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:31,315 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 301 transitions. [2021-11-06 10:18:31,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 301 transitions. [2021-11-06 10:18:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-06 10:18:31,317 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:31,317 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:31,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:18:31,318 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:31,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2061635479, now seen corresponding path program 1 times [2021-11-06 10:18:31,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:31,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904331818] [2021-11-06 10:18:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:31,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:31,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:31,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904331818] [2021-11-06 10:18:31,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904331818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:31,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:31,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:18:31,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760463967] [2021-11-06 10:18:31,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:18:31,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:18:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:18:31,652 INFO L87 Difference]: Start difference. First operand 227 states and 301 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:31,853 INFO L93 Difference]: Finished difference Result 431 states and 571 transitions. [2021-11-06 10:18:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:18:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-06 10:18:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:31,855 INFO L225 Difference]: With dead ends: 431 [2021-11-06 10:18:31,855 INFO L226 Difference]: Without dead ends: 227 [2021-11-06 10:18:31,856 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:18:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-06 10:18:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-11-06 10:18:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 220 states have (on average 1.3590909090909091) internal successors, (299), 226 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 299 transitions. [2021-11-06 10:18:31,862 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 299 transitions. Word has length 22 [2021-11-06 10:18:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:31,862 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 299 transitions. [2021-11-06 10:18:31,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 299 transitions. [2021-11-06 10:18:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-06 10:18:31,863 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:31,865 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:31,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 10:18:31,865 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash 926477308, now seen corresponding path program 1 times [2021-11-06 10:18:31,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:31,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992770796] [2021-11-06 10:18:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:31,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:32,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:32,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992770796] [2021-11-06 10:18:32,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992770796] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:32,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:32,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:18:32,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376771837] [2021-11-06 10:18:32,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:18:32,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:18:32,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:18:32,083 INFO L87 Difference]: Start difference. First operand 227 states and 299 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:32,685 INFO L93 Difference]: Finished difference Result 616 states and 829 transitions. [2021-11-06 10:18:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:18:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-06 10:18:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:32,689 INFO L225 Difference]: With dead ends: 616 [2021-11-06 10:18:32,689 INFO L226 Difference]: Without dead ends: 403 [2021-11-06 10:18:32,690 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:18:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-06 10:18:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 243. [2021-11-06 10:18:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 236 states have (on average 1.3347457627118644) internal successors, (315), 242 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 315 transitions. [2021-11-06 10:18:32,698 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 315 transitions. Word has length 28 [2021-11-06 10:18:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:32,699 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 315 transitions. [2021-11-06 10:18:32,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 315 transitions. [2021-11-06 10:18:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-06 10:18:32,699 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:32,700 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:32,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:18:32,700 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash -94591046, now seen corresponding path program 1 times [2021-11-06 10:18:32,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:32,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245870882] [2021-11-06 10:18:32,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:32,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:32,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:32,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245870882] [2021-11-06 10:18:32,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245870882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:32,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:32,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:18:32,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39678064] [2021-11-06 10:18:32,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:18:32,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:32,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:18:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:18:32,882 INFO L87 Difference]: Start difference. First operand 243 states and 315 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:33,387 INFO L93 Difference]: Finished difference Result 542 states and 711 transitions. [2021-11-06 10:18:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:18:33,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-06 10:18:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:33,389 INFO L225 Difference]: With dead ends: 542 [2021-11-06 10:18:33,389 INFO L226 Difference]: Without dead ends: 323 [2021-11-06 10:18:33,389 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:18:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-06 10:18:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 259. [2021-11-06 10:18:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 252 states have (on average 1.3134920634920635) internal successors, (331), 258 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 331 transitions. [2021-11-06 10:18:33,395 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 331 transitions. Word has length 28 [2021-11-06 10:18:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:33,396 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 331 transitions. [2021-11-06 10:18:33,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 331 transitions. [2021-11-06 10:18:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-06 10:18:33,396 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:33,397 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:33,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:18:33,397 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1374345282, now seen corresponding path program 1 times [2021-11-06 10:18:33,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:33,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586076095] [2021-11-06 10:18:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:33,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:33,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:33,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586076095] [2021-11-06 10:18:33,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586076095] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:33,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:33,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:18:33,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482809223] [2021-11-06 10:18:33,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:18:33,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:18:33,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:18:33,710 INFO L87 Difference]: Start difference. First operand 259 states and 331 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:33,907 INFO L93 Difference]: Finished difference Result 530 states and 674 transitions. [2021-11-06 10:18:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:18:33,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-06 10:18:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:33,911 INFO L225 Difference]: With dead ends: 530 [2021-11-06 10:18:33,912 INFO L226 Difference]: Without dead ends: 497 [2021-11-06 10:18:33,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:18:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-11-06 10:18:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 261. [2021-11-06 10:18:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 254 states have (on average 1.311023622047244) internal successors, (333), 260 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 333 transitions. [2021-11-06 10:18:33,917 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 333 transitions. Word has length 28 [2021-11-06 10:18:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:33,918 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 333 transitions. [2021-11-06 10:18:33,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 333 transitions. [2021-11-06 10:18:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 10:18:33,919 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:33,919 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:33,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:18:33,919 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:33,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1363870332, now seen corresponding path program 1 times [2021-11-06 10:18:33,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:33,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431574947] [2021-11-06 10:18:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:33,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:34,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:34,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431574947] [2021-11-06 10:18:34,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431574947] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:34,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:34,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:18:34,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918954340] [2021-11-06 10:18:34,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:18:34,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:34,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:18:34,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:18:34,357 INFO L87 Difference]: Start difference. First operand 261 states and 333 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:35,298 INFO L93 Difference]: Finished difference Result 412 states and 508 transitions. [2021-11-06 10:18:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:18:35,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-06 10:18:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:35,300 INFO L225 Difference]: With dead ends: 412 [2021-11-06 10:18:35,300 INFO L226 Difference]: Without dead ends: 395 [2021-11-06 10:18:35,301 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:18:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-11-06 10:18:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 275. [2021-11-06 10:18:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 268 states have (on average 1.291044776119403) internal successors, (346), 274 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 346 transitions. [2021-11-06 10:18:35,308 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 346 transitions. Word has length 38 [2021-11-06 10:18:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:35,308 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 346 transitions. [2021-11-06 10:18:35,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 346 transitions. [2021-11-06 10:18:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 10:18:35,309 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:35,309 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:35,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:18:35,310 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1721724466, now seen corresponding path program 1 times [2021-11-06 10:18:35,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:35,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932176325] [2021-11-06 10:18:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:35,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:35,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:35,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932176325] [2021-11-06 10:18:35,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932176325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:35,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:35,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:18:35,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092052797] [2021-11-06 10:18:35,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:18:35,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:18:35,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:18:35,634 INFO L87 Difference]: Start difference. First operand 275 states and 346 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:35,944 INFO L93 Difference]: Finished difference Result 496 states and 623 transitions. [2021-11-06 10:18:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:18:35,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-06 10:18:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:35,947 INFO L225 Difference]: With dead ends: 496 [2021-11-06 10:18:35,947 INFO L226 Difference]: Without dead ends: 275 [2021-11-06 10:18:35,947 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:18:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-06 10:18:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-11-06 10:18:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 268 states have (on average 1.2835820895522387) internal successors, (344), 274 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 344 transitions. [2021-11-06 10:18:35,953 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 344 transitions. Word has length 40 [2021-11-06 10:18:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:35,954 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 344 transitions. [2021-11-06 10:18:35,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 344 transitions. [2021-11-06 10:18:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:18:35,954 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:35,955 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:35,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:18:35,955 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:35,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash -378295308, now seen corresponding path program 1 times [2021-11-06 10:18:35,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:35,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565893164] [2021-11-06 10:18:35,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:35,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:36,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:36,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565893164] [2021-11-06 10:18:36,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565893164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:36,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:36,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:18:36,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956162044] [2021-11-06 10:18:36,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:18:36,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:18:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:18:36,326 INFO L87 Difference]: Start difference. First operand 275 states and 344 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:39,658 INFO L93 Difference]: Finished difference Result 782 states and 972 transitions. [2021-11-06 10:18:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:18:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:18:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:39,660 INFO L225 Difference]: With dead ends: 782 [2021-11-06 10:18:39,660 INFO L226 Difference]: Without dead ends: 528 [2021-11-06 10:18:39,661 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:18:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-11-06 10:18:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 299. [2021-11-06 10:18:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 292 states have (on average 1.2602739726027397) internal successors, (368), 298 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 368 transitions. [2021-11-06 10:18:39,670 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 368 transitions. Word has length 42 [2021-11-06 10:18:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:39,672 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 368 transitions. [2021-11-06 10:18:39,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 368 transitions. [2021-11-06 10:18:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:18:39,678 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:39,678 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:39,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:18:39,678 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:39,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash 301763062, now seen corresponding path program 1 times [2021-11-06 10:18:39,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:39,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651489462] [2021-11-06 10:18:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:39,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:41,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:41,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651489462] [2021-11-06 10:18:41,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651489462] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:41,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:41,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:18:41,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125527542] [2021-11-06 10:18:41,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:18:41,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:41,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:18:41,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:18:41,801 INFO L87 Difference]: Start difference. First operand 299 states and 368 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:48,144 INFO L93 Difference]: Finished difference Result 860 states and 1059 transitions. [2021-11-06 10:18:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:18:48,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:18:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:48,146 INFO L225 Difference]: With dead ends: 860 [2021-11-06 10:18:48,146 INFO L226 Difference]: Without dead ends: 590 [2021-11-06 10:18:48,147 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:18:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2021-11-06 10:18:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 297. [2021-11-06 10:18:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 290 states have (on average 1.2586206896551724) internal successors, (365), 296 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 365 transitions. [2021-11-06 10:18:48,155 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 365 transitions. Word has length 42 [2021-11-06 10:18:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:48,155 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 365 transitions. [2021-11-06 10:18:48,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 365 transitions. [2021-11-06 10:18:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 10:18:48,156 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:48,156 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:48,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:18:48,156 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1878621098, now seen corresponding path program 1 times [2021-11-06 10:18:48,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:48,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040200535] [2021-11-06 10:18:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:48,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:48,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:48,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040200535] [2021-11-06 10:18:48,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040200535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:48,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:48,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:18:48,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602687471] [2021-11-06 10:18:48,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:18:48,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:18:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:18:48,562 INFO L87 Difference]: Start difference. First operand 297 states and 365 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:49,550 INFO L93 Difference]: Finished difference Result 691 states and 837 transitions. [2021-11-06 10:18:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:18:49,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-06 10:18:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:49,554 INFO L225 Difference]: With dead ends: 691 [2021-11-06 10:18:49,554 INFO L226 Difference]: Without dead ends: 420 [2021-11-06 10:18:49,554 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:18:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-11-06 10:18:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 297. [2021-11-06 10:18:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 290 states have (on average 1.2551724137931035) internal successors, (364), 296 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 364 transitions. [2021-11-06 10:18:49,567 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 364 transitions. Word has length 46 [2021-11-06 10:18:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:49,567 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 364 transitions. [2021-11-06 10:18:49,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 364 transitions. [2021-11-06 10:18:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:18:49,569 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:49,570 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:49,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:18:49,570 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1567331845, now seen corresponding path program 1 times [2021-11-06 10:18:49,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:49,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484887504] [2021-11-06 10:18:49,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:49,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:52,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:52,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484887504] [2021-11-06 10:18:52,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484887504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:52,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:52,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:18:52,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662274047] [2021-11-06 10:18:52,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:18:52,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:52,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:18:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:18:52,577 INFO L87 Difference]: Start difference. First operand 297 states and 364 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:57,179 INFO L93 Difference]: Finished difference Result 631 states and 776 transitions. [2021-11-06 10:18:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:18:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:18:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:57,181 INFO L225 Difference]: With dead ends: 631 [2021-11-06 10:18:57,181 INFO L226 Difference]: Without dead ends: 615 [2021-11-06 10:18:57,181 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:18:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-11-06 10:18:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 505. [2021-11-06 10:18:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 498 states have (on average 1.2610441767068272) internal successors, (628), 504 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 628 transitions. [2021-11-06 10:18:57,194 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 628 transitions. Word has length 48 [2021-11-06 10:18:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:57,195 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 628 transitions. [2021-11-06 10:18:57,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 628 transitions. [2021-11-06 10:18:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:18:57,195 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:57,195 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:57,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:18:57,196 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash 134321663, now seen corresponding path program 1 times [2021-11-06 10:18:57,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:57,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616496920] [2021-11-06 10:18:57,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:57,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:57,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:57,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616496920] [2021-11-06 10:18:57,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616496920] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:57,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:57,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:18:57,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888371922] [2021-11-06 10:18:57,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:18:57,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:57,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:18:57,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:18:57,834 INFO L87 Difference]: Start difference. First operand 505 states and 628 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:04,783 INFO L93 Difference]: Finished difference Result 978 states and 1212 transitions. [2021-11-06 10:19:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:19:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:19:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:04,786 INFO L225 Difference]: With dead ends: 978 [2021-11-06 10:19:04,786 INFO L226 Difference]: Without dead ends: 971 [2021-11-06 10:19:04,787 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:19:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-11-06 10:19:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 922. [2021-11-06 10:19:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 915 states have (on average 1.2644808743169398) internal successors, (1157), 921 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1157 transitions. [2021-11-06 10:19:04,816 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1157 transitions. Word has length 48 [2021-11-06 10:19:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:04,817 INFO L470 AbstractCegarLoop]: Abstraction has 922 states and 1157 transitions. [2021-11-06 10:19:04,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1157 transitions. [2021-11-06 10:19:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:19:04,818 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:04,818 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:19:04,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:19:04,819 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:04,819 INFO L85 PathProgramCache]: Analyzing trace with hash 814380033, now seen corresponding path program 1 times [2021-11-06 10:19:04,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:04,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009277344] [2021-11-06 10:19:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:04,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:05,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:05,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009277344] [2021-11-06 10:19:05,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009277344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:05,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:05,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:19:05,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221330761] [2021-11-06 10:19:05,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:19:05,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:19:05,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:19:05,099 INFO L87 Difference]: Start difference. First operand 922 states and 1157 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:08,315 INFO L93 Difference]: Finished difference Result 2236 states and 2814 transitions. [2021-11-06 10:19:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:19:08,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:19:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:08,321 INFO L225 Difference]: With dead ends: 2236 [2021-11-06 10:19:08,321 INFO L226 Difference]: Without dead ends: 1393 [2021-11-06 10:19:08,322 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:19:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2021-11-06 10:19:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 922. [2021-11-06 10:19:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 915 states have (on average 1.2382513661202186) internal successors, (1133), 921 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1133 transitions. [2021-11-06 10:19:08,347 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1133 transitions. Word has length 48 [2021-11-06 10:19:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:08,348 INFO L470 AbstractCegarLoop]: Abstraction has 922 states and 1133 transitions. [2021-11-06 10:19:08,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1133 transitions. [2021-11-06 10:19:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:19:08,348 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:08,349 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:19:08,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:19:08,349 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 156953917, now seen corresponding path program 1 times [2021-11-06 10:19:08,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:08,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148076055] [2021-11-06 10:19:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:08,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:11,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:11,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148076055] [2021-11-06 10:19:11,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148076055] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:11,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:11,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:19:11,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414946892] [2021-11-06 10:19:11,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:19:11,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:11,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:19:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:19:11,616 INFO L87 Difference]: Start difference. First operand 922 states and 1133 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:16,351 INFO L93 Difference]: Finished difference Result 1144 states and 1396 transitions. [2021-11-06 10:19:16,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:19:16,352 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:19:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:16,354 INFO L225 Difference]: With dead ends: 1144 [2021-11-06 10:19:16,354 INFO L226 Difference]: Without dead ends: 1137 [2021-11-06 10:19:16,355 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:19:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2021-11-06 10:19:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 673. [2021-11-06 10:19:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 666 states have (on average 1.2402402402402402) internal successors, (826), 672 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 826 transitions. [2021-11-06 10:19:16,374 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 826 transitions. Word has length 48 [2021-11-06 10:19:16,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:16,375 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 826 transitions. [2021-11-06 10:19:16,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 826 transitions. [2021-11-06 10:19:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:19:16,375 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:16,375 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:19:16,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 10:19:16,376 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1376295925, now seen corresponding path program 1 times [2021-11-06 10:19:16,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:16,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699490619] [2021-11-06 10:19:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:16,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:16,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:16,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699490619] [2021-11-06 10:19:16,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699490619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:16,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:16,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:19:16,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892611682] [2021-11-06 10:19:16,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:19:16,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:16,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:19:16,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:19:16,518 INFO L87 Difference]: Start difference. First operand 673 states and 826 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:16,938 INFO L93 Difference]: Finished difference Result 1172 states and 1428 transitions. [2021-11-06 10:19:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:19:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:19:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:16,940 INFO L225 Difference]: With dead ends: 1172 [2021-11-06 10:19:16,940 INFO L226 Difference]: Without dead ends: 548 [2021-11-06 10:19:16,940 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:19:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2021-11-06 10:19:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 482. [2021-11-06 10:19:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 475 states have (on average 1.223157894736842) internal successors, (581), 481 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 581 transitions. [2021-11-06 10:19:16,955 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 581 transitions. Word has length 48 [2021-11-06 10:19:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:16,955 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 581 transitions. [2021-11-06 10:19:16,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 581 transitions. [2021-11-06 10:19:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 10:19:16,956 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:16,956 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:19:16,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 10:19:16,956 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1351206458, now seen corresponding path program 1 times [2021-11-06 10:19:16,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:16,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49001201] [2021-11-06 10:19:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:16,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:17,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:17,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49001201] [2021-11-06 10:19:17,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49001201] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:17,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:17,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:19:17,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561195707] [2021-11-06 10:19:17,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:19:17,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:19:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:19:17,380 INFO L87 Difference]: Start difference. First operand 482 states and 581 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:19,166 INFO L93 Difference]: Finished difference Result 752 states and 893 transitions. [2021-11-06 10:19:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:19:19,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-06 10:19:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:19,169 INFO L225 Difference]: With dead ends: 752 [2021-11-06 10:19:19,169 INFO L226 Difference]: Without dead ends: 731 [2021-11-06 10:19:19,169 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:19:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-11-06 10:19:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 496. [2021-11-06 10:19:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 489 states have (on average 1.2147239263803682) internal successors, (594), 495 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 594 transitions. [2021-11-06 10:19:19,184 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 594 transitions. Word has length 50 [2021-11-06 10:19:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:19,184 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 594 transitions. [2021-11-06 10:19:19,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 594 transitions. [2021-11-06 10:19:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 10:19:19,185 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:19,185 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:19:19,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 10:19:19,186 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash 541859832, now seen corresponding path program 1 times [2021-11-06 10:19:19,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:19,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845442051] [2021-11-06 10:19:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:19,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:19,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:19,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845442051] [2021-11-06 10:19:19,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845442051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:19,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:19,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:19:19,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808840199] [2021-11-06 10:19:19,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:19:19,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:19:19,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:19:19,800 INFO L87 Difference]: Start difference. First operand 496 states and 594 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:31,782 INFO L93 Difference]: Finished difference Result 891 states and 1034 transitions. [2021-11-06 10:19:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-06 10:19:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-06 10:19:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:31,785 INFO L225 Difference]: With dead ends: 891 [2021-11-06 10:19:31,792 INFO L226 Difference]: Without dead ends: 853 [2021-11-06 10:19:31,792 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:19:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2021-11-06 10:19:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 698. [2021-11-06 10:19:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 691 states have (on average 1.2141823444283646) internal successors, (839), 697 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 839 transitions. [2021-11-06 10:19:31,810 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 839 transitions. Word has length 50 [2021-11-06 10:19:31,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:31,811 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 839 transitions. [2021-11-06 10:19:31,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 839 transitions. [2021-11-06 10:19:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 10:19:31,811 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:31,811 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:19:31,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 10:19:31,812 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:31,812 INFO L85 PathProgramCache]: Analyzing trace with hash 816619446, now seen corresponding path program 1 times [2021-11-06 10:19:31,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:31,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912450985] [2021-11-06 10:19:31,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:31,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:34,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:34,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912450985] [2021-11-06 10:19:34,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912450985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:34,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:34,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:19:34,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881602576] [2021-11-06 10:19:34,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 10:19:34,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 10:19:34,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:19:34,235 INFO L87 Difference]: Start difference. First operand 698 states and 839 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:49,405 INFO L93 Difference]: Finished difference Result 1316 states and 1554 transitions. [2021-11-06 10:19:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-06 10:19:49,406 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-06 10:19:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:49,409 INFO L225 Difference]: With dead ends: 1316 [2021-11-06 10:19:49,409 INFO L226 Difference]: Without dead ends: 1253 [2021-11-06 10:19:49,410 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=941, Invalid=3889, Unknown=0, NotChecked=0, Total=4830 [2021-11-06 10:19:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2021-11-06 10:19:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 620. [2021-11-06 10:19:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 613 states have (on average 1.2185970636215335) internal successors, (747), 619 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 747 transitions. [2021-11-06 10:19:49,427 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 747 transitions. Word has length 50 [2021-11-06 10:19:49,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:49,427 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 747 transitions. [2021-11-06 10:19:49,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 747 transitions. [2021-11-06 10:19:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 10:19:49,428 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:49,428 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:19:49,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 10:19:49,429 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1408081534, now seen corresponding path program 1 times [2021-11-06 10:19:49,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:49,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549427002] [2021-11-06 10:19:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:49,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:49,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:49,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549427002] [2021-11-06 10:19:49,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549427002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:49,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:49,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:19:49,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561943903] [2021-11-06 10:19:49,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:19:49,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:19:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:19:49,669 INFO L87 Difference]: Start difference. First operand 620 states and 747 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:49,984 INFO L93 Difference]: Finished difference Result 879 states and 1034 transitions. [2021-11-06 10:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:19:49,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-06 10:19:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:49,986 INFO L225 Difference]: With dead ends: 879 [2021-11-06 10:19:49,986 INFO L226 Difference]: Without dead ends: 810 [2021-11-06 10:19:49,986 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:19:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-11-06 10:19:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 602. [2021-11-06 10:19:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 595 states have (on average 1.2084033613445377) internal successors, (719), 601 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 719 transitions. [2021-11-06 10:19:50,002 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 719 transitions. Word has length 56 [2021-11-06 10:19:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:50,002 INFO L470 AbstractCegarLoop]: Abstraction has 602 states and 719 transitions. [2021-11-06 10:19:50,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 719 transitions. [2021-11-06 10:19:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 10:19:50,003 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:50,003 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:19:50,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 10:19:50,004 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:50,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1914886215, now seen corresponding path program 1 times [2021-11-06 10:19:50,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:50,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489982330] [2021-11-06 10:19:50,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:50,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:50,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:50,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489982330] [2021-11-06 10:19:50,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489982330] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:50,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:50,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:19:50,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615804035] [2021-11-06 10:19:50,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:19:50,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:19:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:19:50,166 INFO L87 Difference]: Start difference. First operand 602 states and 719 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:50,266 INFO L93 Difference]: Finished difference Result 758 states and 893 transitions. [2021-11-06 10:19:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:19:50,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 10:19:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:50,268 INFO L225 Difference]: With dead ends: 758 [2021-11-06 10:19:50,268 INFO L226 Difference]: Without dead ends: 696 [2021-11-06 10:19:50,268 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:19:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-11-06 10:19:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 570. [2021-11-06 10:19:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 563 states have (on average 1.2078152753108349) internal successors, (680), 569 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 680 transitions. [2021-11-06 10:19:50,282 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 680 transitions. Word has length 62 [2021-11-06 10:19:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:50,283 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 680 transitions. [2021-11-06 10:19:50,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 680 transitions. [2021-11-06 10:19:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 10:19:50,283 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:50,284 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:19:50,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 10:19:50,284 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1834524617, now seen corresponding path program 1 times [2021-11-06 10:19:50,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:50,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806910629] [2021-11-06 10:19:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:50,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:50,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:50,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806910629] [2021-11-06 10:19:50,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806910629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:50,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:50,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:19:50,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070843613] [2021-11-06 10:19:50,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:19:50,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:19:50,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:19:50,564 INFO L87 Difference]: Start difference. First operand 570 states and 680 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:19:50,908 INFO L93 Difference]: Finished difference Result 922 states and 1105 transitions. [2021-11-06 10:19:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:19:50,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-06 10:19:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:19:50,918 INFO L225 Difference]: With dead ends: 922 [2021-11-06 10:19:50,918 INFO L226 Difference]: Without dead ends: 570 [2021-11-06 10:19:50,919 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:19:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-11-06 10:19:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-11-06 10:19:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 563 states have (on average 1.191829484902309) internal successors, (671), 569 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 671 transitions. [2021-11-06 10:19:50,933 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 671 transitions. Word has length 63 [2021-11-06 10:19:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:19:50,934 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 671 transitions. [2021-11-06 10:19:50,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:19:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 671 transitions. [2021-11-06 10:19:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 10:19:50,934 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:19:50,934 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:19:50,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 10:19:50,935 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:19:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:19:50,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1289082123, now seen corresponding path program 1 times [2021-11-06 10:19:50,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:19:50,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904066869] [2021-11-06 10:19:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:19:50,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:19:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:19:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:19:51,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:19:51,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904066869] [2021-11-06 10:19:51,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904066869] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:19:51,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:19:51,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:19:51,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346462194] [2021-11-06 10:19:51,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:19:51,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:19:51,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:19:51,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:19:51,481 INFO L87 Difference]: Start difference. First operand 570 states and 671 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:03,699 INFO L93 Difference]: Finished difference Result 1146 states and 1322 transitions. [2021-11-06 10:20:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:20:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 10:20:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:03,701 INFO L225 Difference]: With dead ends: 1146 [2021-11-06 10:20:03,701 INFO L226 Difference]: Without dead ends: 766 [2021-11-06 10:20:03,702 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:20:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-11-06 10:20:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 572. [2021-11-06 10:20:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 565 states have (on average 1.191150442477876) internal successors, (673), 571 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 673 transitions. [2021-11-06 10:20:03,718 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 673 transitions. Word has length 64 [2021-11-06 10:20:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:03,719 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 673 transitions. [2021-11-06 10:20:03,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 673 transitions. [2021-11-06 10:20:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 10:20:03,720 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:03,720 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:20:03,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 10:20:03,720 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:20:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1547247561, now seen corresponding path program 1 times [2021-11-06 10:20:03,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:03,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258597483] [2021-11-06 10:20:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:03,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:20:05,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:05,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258597483] [2021-11-06 10:20:05,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258597483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:05,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:05,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:20:05,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783647470] [2021-11-06 10:20:05,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:20:05,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:05,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:20:05,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:20:05,332 INFO L87 Difference]: Start difference. First operand 572 states and 673 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:13,914 INFO L93 Difference]: Finished difference Result 1150 states and 1338 transitions. [2021-11-06 10:20:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-06 10:20:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 10:20:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:13,917 INFO L225 Difference]: With dead ends: 1150 [2021-11-06 10:20:13,917 INFO L226 Difference]: Without dead ends: 660 [2021-11-06 10:20:13,917 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2021-11-06 10:20:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-11-06 10:20:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 570. [2021-11-06 10:20:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 563 states have (on average 1.1882770870337478) internal successors, (669), 569 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 669 transitions. [2021-11-06 10:20:13,934 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 669 transitions. Word has length 64 [2021-11-06 10:20:13,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:13,934 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 669 transitions. [2021-11-06 10:20:13,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 669 transitions. [2021-11-06 10:20:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-06 10:20:13,935 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:13,935 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:20:13,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 10:20:13,936 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:20:13,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1614432707, now seen corresponding path program 1 times [2021-11-06 10:20:13,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:13,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467997606] [2021-11-06 10:20:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:13,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:20:14,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:14,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467997606] [2021-11-06 10:20:14,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467997606] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:14,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:14,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:20:14,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250135786] [2021-11-06 10:20:14,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:20:14,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:14,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:20:14,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:20:14,301 INFO L87 Difference]: Start difference. First operand 570 states and 669 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:15,189 INFO L93 Difference]: Finished difference Result 1254 states and 1477 transitions. [2021-11-06 10:20:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:20:15,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-11-06 10:20:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:15,191 INFO L225 Difference]: With dead ends: 1254 [2021-11-06 10:20:15,191 INFO L226 Difference]: Without dead ends: 748 [2021-11-06 10:20:15,192 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:20:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-11-06 10:20:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 556. [2021-11-06 10:20:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 549 states have (on average 1.1839708561020037) internal successors, (650), 555 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 650 transitions. [2021-11-06 10:20:15,209 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 650 transitions. Word has length 68 [2021-11-06 10:20:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:15,209 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 650 transitions. [2021-11-06 10:20:15,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 650 transitions. [2021-11-06 10:20:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-06 10:20:15,210 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:15,210 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:20:15,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 10:20:15,211 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:20:15,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:15,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1138480632, now seen corresponding path program 1 times [2021-11-06 10:20:15,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:15,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690605676] [2021-11-06 10:20:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:15,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:20:17,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:17,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690605676] [2021-11-06 10:20:17,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690605676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:17,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:17,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:20:17,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603583705] [2021-11-06 10:20:17,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:20:17,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:17,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:20:17,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:20:17,666 INFO L87 Difference]: Start difference. First operand 556 states and 650 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:22,316 INFO L93 Difference]: Finished difference Result 1107 states and 1294 transitions. [2021-11-06 10:20:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:20:22,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-06 10:20:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:22,318 INFO L225 Difference]: With dead ends: 1107 [2021-11-06 10:20:22,318 INFO L226 Difference]: Without dead ends: 556 [2021-11-06 10:20:22,319 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:20:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-11-06 10:20:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2021-11-06 10:20:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 549 states have (on average 1.1821493624772312) internal successors, (649), 555 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 649 transitions. [2021-11-06 10:20:22,334 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 649 transitions. Word has length 70 [2021-11-06 10:20:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:22,334 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 649 transitions. [2021-11-06 10:20:22,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 649 transitions. [2021-11-06 10:20:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:20:22,335 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:22,335 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:20:22,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 10:20:22,335 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:20:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:22,336 INFO L85 PathProgramCache]: Analyzing trace with hash 752019653, now seen corresponding path program 1 times [2021-11-06 10:20:22,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:22,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878869658] [2021-11-06 10:20:22,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:22,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:20:26,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:26,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878869658] [2021-11-06 10:20:26,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878869658] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:26,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:26,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:20:26,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027254636] [2021-11-06 10:20:26,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:20:26,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:20:26,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:20:26,280 INFO L87 Difference]: Start difference. First operand 556 states and 649 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:36,350 INFO L93 Difference]: Finished difference Result 590 states and 678 transitions. [2021-11-06 10:20:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:20:36,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-06 10:20:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:36,352 INFO L225 Difference]: With dead ends: 590 [2021-11-06 10:20:36,352 INFO L226 Difference]: Without dead ends: 574 [2021-11-06 10:20:36,352 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:20:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-11-06 10:20:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 545. [2021-11-06 10:20:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 538 states have (on average 1.1802973977695168) internal successors, (635), 544 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 635 transitions. [2021-11-06 10:20:36,368 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 635 transitions. Word has length 71 [2021-11-06 10:20:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:36,368 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 635 transitions. [2021-11-06 10:20:36,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 635 transitions. [2021-11-06 10:20:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:20:36,369 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:36,369 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:20:36,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 10:20:36,370 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:20:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash -680990529, now seen corresponding path program 1 times [2021-11-06 10:20:36,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:36,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040629520] [2021-11-06 10:20:36,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:36,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:20:37,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:37,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040629520] [2021-11-06 10:20:37,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040629520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:37,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:37,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:20:37,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728482845] [2021-11-06 10:20:37,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:20:37,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:37,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:20:37,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:20:37,016 INFO L87 Difference]: Start difference. First operand 545 states and 635 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:46,517 INFO L93 Difference]: Finished difference Result 720 states and 817 transitions. [2021-11-06 10:20:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-06 10:20:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-06 10:20:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:46,520 INFO L225 Difference]: With dead ends: 720 [2021-11-06 10:20:46,520 INFO L226 Difference]: Without dead ends: 713 [2021-11-06 10:20:46,520 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:20:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-11-06 10:20:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 554. [2021-11-06 10:20:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 547 states have (on average 1.1773308957952469) internal successors, (644), 553 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 644 transitions. [2021-11-06 10:20:46,538 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 644 transitions. Word has length 71 [2021-11-06 10:20:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:46,538 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 644 transitions. [2021-11-06 10:20:46,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 644 transitions. [2021-11-06 10:20:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:20:46,539 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:46,539 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:20:46,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 10:20:46,539 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:20:46,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:46,540 INFO L85 PathProgramCache]: Analyzing trace with hash 857349501, now seen corresponding path program 1 times [2021-11-06 10:20:46,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:46,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008587321] [2021-11-06 10:20:46,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:46,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:20:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:20:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:20:47,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:20:47,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008587321] [2021-11-06 10:20:47,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008587321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:20:47,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:20:47,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:20:47,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822517630] [2021-11-06 10:20:47,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:20:47,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:20:47,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:20:47,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:20:47,037 INFO L87 Difference]: Start difference. First operand 554 states and 644 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:20:57,652 INFO L93 Difference]: Finished difference Result 1093 states and 1260 transitions. [2021-11-06 10:20:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:20:57,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-06 10:20:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:20:57,655 INFO L225 Difference]: With dead ends: 1093 [2021-11-06 10:20:57,655 INFO L226 Difference]: Without dead ends: 679 [2021-11-06 10:20:57,656 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:20:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-11-06 10:20:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 554. [2021-11-06 10:20:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 547 states have (on average 1.1755027422303475) internal successors, (643), 553 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 643 transitions. [2021-11-06 10:20:57,671 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 643 transitions. Word has length 71 [2021-11-06 10:20:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:20:57,671 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 643 transitions. [2021-11-06 10:20:57,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:20:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 643 transitions. [2021-11-06 10:20:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:20:57,672 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:20:57,672 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:20:57,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 10:20:57,673 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:20:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:20:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1558949375, now seen corresponding path program 1 times [2021-11-06 10:20:57,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:20:57,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610526899] [2021-11-06 10:20:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:20:57,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:21:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:21:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:21:01,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:21:01,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610526899] [2021-11-06 10:21:01,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610526899] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:21:01,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:21:01,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:21:01,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510103938] [2021-11-06 10:21:01,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:21:01,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:21:01,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:21:01,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:21:01,921 INFO L87 Difference]: Start difference. First operand 554 states and 643 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:21:15,429 INFO L93 Difference]: Finished difference Result 582 states and 666 transitions. [2021-11-06 10:21:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:21:15,429 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-06 10:21:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:21:15,431 INFO L225 Difference]: With dead ends: 582 [2021-11-06 10:21:15,431 INFO L226 Difference]: Without dead ends: 575 [2021-11-06 10:21:15,431 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:21:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-11-06 10:21:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 545. [2021-11-06 10:21:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 538 states have (on average 1.1765799256505576) internal successors, (633), 544 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 633 transitions. [2021-11-06 10:21:15,453 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 633 transitions. Word has length 71 [2021-11-06 10:21:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:21:15,453 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 633 transitions. [2021-11-06 10:21:15,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 633 transitions. [2021-11-06 10:21:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 10:21:15,453 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:21:15,453 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:21:15,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 10:21:15,454 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:21:15,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:21:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1289124232, now seen corresponding path program 1 times [2021-11-06 10:21:15,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:21:15,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983887317] [2021-11-06 10:21:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:21:15,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:21:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:21:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:21:16,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:21:16,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983887317] [2021-11-06 10:21:16,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983887317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:21:16,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:21:16,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:21:16,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007279040] [2021-11-06 10:21:16,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:21:16,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:21:16,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:21:16,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:21:16,107 INFO L87 Difference]: Start difference. First operand 545 states and 633 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:21:30,846 INFO L93 Difference]: Finished difference Result 1103 states and 1261 transitions. [2021-11-06 10:21:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-06 10:21:30,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-06 10:21:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:21:30,848 INFO L225 Difference]: With dead ends: 1103 [2021-11-06 10:21:30,849 INFO L226 Difference]: Without dead ends: 724 [2021-11-06 10:21:30,849 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:21:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2021-11-06 10:21:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 545. [2021-11-06 10:21:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 538 states have (on average 1.1728624535315986) internal successors, (631), 544 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 631 transitions. [2021-11-06 10:21:30,882 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 631 transitions. Word has length 73 [2021-11-06 10:21:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:21:30,882 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 631 transitions. [2021-11-06 10:21:30,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 631 transitions. [2021-11-06 10:21:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 10:21:30,883 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:21:30,883 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:21:30,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 10:21:30,883 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:21:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:21:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash -485491784, now seen corresponding path program 1 times [2021-11-06 10:21:30,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:21:30,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977733979] [2021-11-06 10:21:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:21:30,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:21:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:21:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:21:33,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:21:33,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977733979] [2021-11-06 10:21:33,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977733979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:21:33,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:21:33,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:21:33,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375717869] [2021-11-06 10:21:33,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:21:33,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:21:33,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:21:33,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:21:33,324 INFO L87 Difference]: Start difference. First operand 545 states and 631 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:21:44,383 INFO L93 Difference]: Finished difference Result 763 states and 883 transitions. [2021-11-06 10:21:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-06 10:21:44,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-06 10:21:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:21:44,385 INFO L225 Difference]: With dead ends: 763 [2021-11-06 10:21:44,385 INFO L226 Difference]: Without dead ends: 745 [2021-11-06 10:21:44,386 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=423, Invalid=1557, Unknown=0, NotChecked=0, Total=1980 [2021-11-06 10:21:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-11-06 10:21:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 527. [2021-11-06 10:21:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 521 states have (on average 1.1765834932821497) internal successors, (613), 526 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 613 transitions. [2021-11-06 10:21:44,415 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 613 transitions. Word has length 73 [2021-11-06 10:21:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:21:44,415 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 613 transitions. [2021-11-06 10:21:44,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:21:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 613 transitions. [2021-11-06 10:21:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 10:21:44,416 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:21:44,416 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:21:44,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 10:21:44,417 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:21:44,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:21:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1056511684, now seen corresponding path program 1 times [2021-11-06 10:21:44,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:21:44,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035125305] [2021-11-06 10:21:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:21:44,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:21:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:21:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:21:46,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:21:46,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035125305] [2021-11-06 10:21:46,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035125305] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:21:46,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:21:46,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:21:46,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24311284] [2021-11-06 10:21:46,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:21:46,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:21:46,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:21:46,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:21:46,518 INFO L87 Difference]: Start difference. First operand 527 states and 613 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:22:00,770 INFO L93 Difference]: Finished difference Result 960 states and 1107 transitions. [2021-11-06 10:22:00,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:22:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-06 10:22:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:22:00,772 INFO L225 Difference]: With dead ends: 960 [2021-11-06 10:22:00,772 INFO L226 Difference]: Without dead ends: 929 [2021-11-06 10:22:00,773 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:22:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2021-11-06 10:22:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 525. [2021-11-06 10:22:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 519 states have (on average 1.1753371868978806) internal successors, (610), 524 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 610 transitions. [2021-11-06 10:22:00,794 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 610 transitions. Word has length 77 [2021-11-06 10:22:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:22:00,794 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 610 transitions. [2021-11-06 10:22:00,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 610 transitions. [2021-11-06 10:22:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-06 10:22:00,795 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:22:00,795 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:22:00,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 10:22:00,796 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:22:00,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:22:00,796 INFO L85 PathProgramCache]: Analyzing trace with hash -330775101, now seen corresponding path program 1 times [2021-11-06 10:22:00,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:22:00,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106697479] [2021-11-06 10:22:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:22:00,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:22:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:22:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:22:02,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:22:02,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106697479] [2021-11-06 10:22:02,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106697479] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:22:02,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:22:02,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:22:02,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867549721] [2021-11-06 10:22:02,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:22:02,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:22:02,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:22:02,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:22:02,744 INFO L87 Difference]: Start difference. First operand 525 states and 610 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:22:17,955 INFO L93 Difference]: Finished difference Result 1409 states and 1624 transitions. [2021-11-06 10:22:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-06 10:22:17,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-06 10:22:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:22:17,958 INFO L225 Difference]: With dead ends: 1409 [2021-11-06 10:22:17,958 INFO L226 Difference]: Without dead ends: 1054 [2021-11-06 10:22:17,959 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=393, Invalid=1329, Unknown=0, NotChecked=0, Total=1722 [2021-11-06 10:22:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-11-06 10:22:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 531. [2021-11-06 10:22:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 525 states have (on average 1.1752380952380952) internal successors, (617), 530 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 617 transitions. [2021-11-06 10:22:17,984 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 617 transitions. Word has length 86 [2021-11-06 10:22:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:22:17,984 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 617 transitions. [2021-11-06 10:22:17,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 617 transitions. [2021-11-06 10:22:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-06 10:22:17,985 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:22:17,985 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:22:17,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 10:22:17,985 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:22:17,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:22:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1242647049, now seen corresponding path program 1 times [2021-11-06 10:22:17,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:22:17,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080420868] [2021-11-06 10:22:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:22:17,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:22:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:22:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:22:18,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:22:18,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080420868] [2021-11-06 10:22:18,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080420868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:22:18,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:22:18,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:22:18,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855645363] [2021-11-06 10:22:18,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:22:18,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:22:18,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:22:18,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:22:18,380 INFO L87 Difference]: Start difference. First operand 531 states and 617 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:22:19,006 INFO L93 Difference]: Finished difference Result 978 states and 1138 transitions. [2021-11-06 10:22:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:22:19,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-06 10:22:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:22:19,008 INFO L225 Difference]: With dead ends: 978 [2021-11-06 10:22:19,008 INFO L226 Difference]: Without dead ends: 601 [2021-11-06 10:22:19,008 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:22:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-11-06 10:22:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 522. [2021-11-06 10:22:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 516 states have (on average 1.1666666666666667) internal successors, (602), 521 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 602 transitions. [2021-11-06 10:22:19,030 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 602 transitions. Word has length 90 [2021-11-06 10:22:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:22:19,030 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 602 transitions. [2021-11-06 10:22:19,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 602 transitions. [2021-11-06 10:22:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 10:22:19,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:22:19,031 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:22:19,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 10:22:19,032 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:22:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:22:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash -511953164, now seen corresponding path program 1 times [2021-11-06 10:22:19,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:22:19,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407784381] [2021-11-06 10:22:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:22:19,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:22:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:22:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:22:23,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:22:23,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407784381] [2021-11-06 10:22:23,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407784381] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:22:23,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:22:23,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:22:23,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554993392] [2021-11-06 10:22:23,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:22:23,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:22:23,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:22:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:22:23,322 INFO L87 Difference]: Start difference. First operand 522 states and 602 transitions. Second operand has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:22:40,967 INFO L93 Difference]: Finished difference Result 925 states and 1052 transitions. [2021-11-06 10:22:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-06 10:22:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-06 10:22:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:22:40,970 INFO L225 Difference]: With dead ends: 925 [2021-11-06 10:22:40,970 INFO L226 Difference]: Without dead ends: 806 [2021-11-06 10:22:40,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2021-11-06 10:22:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-11-06 10:22:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 492. [2021-11-06 10:22:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 486 states have (on average 1.1563786008230452) internal successors, (562), 491 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 562 transitions. [2021-11-06 10:22:40,997 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 562 transitions. Word has length 92 [2021-11-06 10:22:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:22:40,998 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 562 transitions. [2021-11-06 10:22:40,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 562 transitions. [2021-11-06 10:22:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 10:22:40,999 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:22:40,999 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:22:40,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 10:22:40,999 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:22:40,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:22:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1944963346, now seen corresponding path program 1 times [2021-11-06 10:22:41,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:22:41,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263728810] [2021-11-06 10:22:41,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:22:41,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:22:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:22:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:22:41,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:22:41,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263728810] [2021-11-06 10:22:41,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263728810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:22:41,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:22:41,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:22:41,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007822527] [2021-11-06 10:22:41,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:22:41,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:22:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:22:41,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:22:41,640 INFO L87 Difference]: Start difference. First operand 492 states and 562 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:22:47,675 INFO L93 Difference]: Finished difference Result 876 states and 999 transitions. [2021-11-06 10:22:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:22:47,676 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-06 10:22:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:22:47,678 INFO L225 Difference]: With dead ends: 876 [2021-11-06 10:22:47,678 INFO L226 Difference]: Without dead ends: 791 [2021-11-06 10:22:47,678 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:22:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-11-06 10:22:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 638. [2021-11-06 10:22:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 632 states have (on average 1.1693037974683544) internal successors, (739), 637 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 739 transitions. [2021-11-06 10:22:47,710 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 739 transitions. Word has length 92 [2021-11-06 10:22:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:22:47,710 INFO L470 AbstractCegarLoop]: Abstraction has 638 states and 739 transitions. [2021-11-06 10:22:47,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:22:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 739 transitions. [2021-11-06 10:22:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 10:22:47,711 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:22:47,711 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:22:47,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 10:22:47,711 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:22:47,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:22:47,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1804414736, now seen corresponding path program 1 times [2021-11-06 10:22:47,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:22:47,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090249580] [2021-11-06 10:22:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:22:47,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:22:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:22:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:22:48,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:22:48,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090249580] [2021-11-06 10:22:48,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090249580] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:22:48,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:22:48,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-06 10:22:48,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539030384] [2021-11-06 10:22:48,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-06 10:22:48,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:22:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-06 10:22:48,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:22:48,822 INFO L87 Difference]: Start difference. First operand 638 states and 739 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:23:08,153 INFO L93 Difference]: Finished difference Result 1568 states and 1782 transitions. [2021-11-06 10:23:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-06 10:23:08,153 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-06 10:23:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:23:08,156 INFO L225 Difference]: With dead ends: 1568 [2021-11-06 10:23:08,156 INFO L226 Difference]: Without dead ends: 1274 [2021-11-06 10:23:08,158 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=574, Invalid=2182, Unknown=0, NotChecked=0, Total=2756 [2021-11-06 10:23:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2021-11-06 10:23:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 703. [2021-11-06 10:23:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 697 states have (on average 1.157819225251076) internal successors, (807), 702 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 807 transitions. [2021-11-06 10:23:08,196 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 807 transitions. Word has length 92 [2021-11-06 10:23:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:23:08,196 INFO L470 AbstractCegarLoop]: Abstraction has 703 states and 807 transitions. [2021-11-06 10:23:08,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 807 transitions. [2021-11-06 10:23:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 10:23:08,197 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:23:08,197 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:23:08,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 10:23:08,197 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:23:08,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:23:08,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2117850032, now seen corresponding path program 1 times [2021-11-06 10:23:08,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:23:08,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141814364] [2021-11-06 10:23:08,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:23:08,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:23:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:23:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:23:13,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:23:13,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141814364] [2021-11-06 10:23:13,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141814364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:23:13,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:23:13,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:23:13,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091304433] [2021-11-06 10:23:13,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:23:13,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:23:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:23:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:23:13,999 INFO L87 Difference]: Start difference. First operand 703 states and 807 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:23:20,492 INFO L93 Difference]: Finished difference Result 885 states and 1001 transitions. [2021-11-06 10:23:20,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 10:23:20,492 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-06 10:23:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:23:20,494 INFO L225 Difference]: With dead ends: 885 [2021-11-06 10:23:20,494 INFO L226 Difference]: Without dead ends: 808 [2021-11-06 10:23:20,495 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2021-11-06 10:23:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2021-11-06 10:23:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 674. [2021-11-06 10:23:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 668 states have (on average 1.160179640718563) internal successors, (775), 673 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 775 transitions. [2021-11-06 10:23:20,532 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 775 transitions. Word has length 92 [2021-11-06 10:23:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:23:20,532 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 775 transitions. [2021-11-06 10:23:20,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 775 transitions. [2021-11-06 10:23:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:23:20,533 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:23:20,533 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:23:20,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-06 10:23:20,533 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:23:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:23:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1677019333, now seen corresponding path program 1 times [2021-11-06 10:23:20,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:23:20,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282517423] [2021-11-06 10:23:20,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:23:20,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:23:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:23:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:23:21,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:23:21,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282517423] [2021-11-06 10:23:21,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282517423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:23:21,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:23:21,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:23:21,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599572314] [2021-11-06 10:23:21,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:23:21,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:23:21,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:23:21,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:23:21,310 INFO L87 Difference]: Start difference. First operand 674 states and 775 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:23:30,585 INFO L93 Difference]: Finished difference Result 811 states and 916 transitions. [2021-11-06 10:23:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-06 10:23:30,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:23:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:23:30,588 INFO L225 Difference]: With dead ends: 811 [2021-11-06 10:23:30,588 INFO L226 Difference]: Without dead ends: 799 [2021-11-06 10:23:30,588 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2021-11-06 10:23:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2021-11-06 10:23:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 717. [2021-11-06 10:23:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 711 states have (on average 1.1617440225035163) internal successors, (826), 716 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 826 transitions. [2021-11-06 10:23:30,630 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 826 transitions. Word has length 93 [2021-11-06 10:23:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:23:30,630 INFO L470 AbstractCegarLoop]: Abstraction has 717 states and 826 transitions. [2021-11-06 10:23:30,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 826 transitions. [2021-11-06 10:23:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:23:30,631 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:23:30,631 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:23:30,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-06 10:23:30,631 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:23:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:23:30,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1418853895, now seen corresponding path program 1 times [2021-11-06 10:23:30,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:23:30,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136562875] [2021-11-06 10:23:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:23:30,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:23:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:23:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:23:31,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:23:31,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136562875] [2021-11-06 10:23:31,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136562875] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:23:31,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:23:31,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:23:31,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766911118] [2021-11-06 10:23:31,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:23:31,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:23:31,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:23:31,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:23:31,875 INFO L87 Difference]: Start difference. First operand 717 states and 826 transitions. Second operand has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:23:51,334 INFO L93 Difference]: Finished difference Result 1121 states and 1279 transitions. [2021-11-06 10:23:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:23:51,335 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:23:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:23:51,337 INFO L225 Difference]: With dead ends: 1121 [2021-11-06 10:23:51,337 INFO L226 Difference]: Without dead ends: 1107 [2021-11-06 10:23:51,338 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2021-11-06 10:23:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-11-06 10:23:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 802. [2021-11-06 10:23:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 796 states have (on average 1.1608040201005025) internal successors, (924), 801 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 924 transitions. [2021-11-06 10:23:51,387 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 924 transitions. Word has length 93 [2021-11-06 10:23:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:23:51,387 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 924 transitions. [2021-11-06 10:23:51,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:23:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 924 transitions. [2021-11-06 10:23:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:23:51,388 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:23:51,388 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:23:51,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-06 10:23:51,388 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:23:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:23:51,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1184937781, now seen corresponding path program 1 times [2021-11-06 10:23:51,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:23:51,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625297456] [2021-11-06 10:23:51,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:23:51,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:23:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:23:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:23:52,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:23:52,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625297456] [2021-11-06 10:23:52,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625297456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:23:52,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:23:52,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-06 10:23:52,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778825579] [2021-11-06 10:23:52,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-06 10:23:52,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:23:52,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-06 10:23:52,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:23:52,801 INFO L87 Difference]: Start difference. First operand 802 states and 924 transitions. Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:24:19,885 INFO L93 Difference]: Finished difference Result 1114 states and 1270 transitions. [2021-11-06 10:24:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-06 10:24:19,885 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:24:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:24:19,889 INFO L225 Difference]: With dead ends: 1114 [2021-11-06 10:24:19,889 INFO L226 Difference]: Without dead ends: 1107 [2021-11-06 10:24:19,889 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=396, Invalid=1326, Unknown=0, NotChecked=0, Total=1722 [2021-11-06 10:24:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-11-06 10:24:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 809. [2021-11-06 10:24:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 803 states have (on average 1.1594022415940224) internal successors, (931), 808 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 931 transitions. [2021-11-06 10:24:19,939 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 931 transitions. Word has length 93 [2021-11-06 10:24:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:24:19,939 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 931 transitions. [2021-11-06 10:24:19,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 931 transitions. [2021-11-06 10:24:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:24:19,940 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:24:19,940 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:24:19,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-06 10:24:19,940 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:24:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:24:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash -87730375, now seen corresponding path program 1 times [2021-11-06 10:24:19,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:24:19,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469420864] [2021-11-06 10:24:19,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:24:19,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:24:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:24:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:24:25,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:24:25,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469420864] [2021-11-06 10:24:25,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469420864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:24:25,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:24:25,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:24:25,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119052189] [2021-11-06 10:24:25,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-06 10:24:25,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:24:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-06 10:24:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:24:25,253 INFO L87 Difference]: Start difference. First operand 809 states and 931 transitions. Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:24:41,081 INFO L93 Difference]: Finished difference Result 1290 states and 1465 transitions. [2021-11-06 10:24:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-06 10:24:41,082 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 10:24:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:24:41,083 INFO L225 Difference]: With dead ends: 1290 [2021-11-06 10:24:41,083 INFO L226 Difference]: Without dead ends: 1220 [2021-11-06 10:24:41,084 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=411, Invalid=1229, Unknown=0, NotChecked=0, Total=1640 [2021-11-06 10:24:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2021-11-06 10:24:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 915. [2021-11-06 10:24:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.166116611661166) internal successors, (1060), 914 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1060 transitions. [2021-11-06 10:24:41,149 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1060 transitions. Word has length 93 [2021-11-06 10:24:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:24:41,149 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1060 transitions. [2021-11-06 10:24:41,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1060 transitions. [2021-11-06 10:24:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-06 10:24:41,150 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:24:41,150 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:24:41,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-06 10:24:41,151 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:24:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:24:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2118871911, now seen corresponding path program 1 times [2021-11-06 10:24:41,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:24:41,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586712343] [2021-11-06 10:24:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:24:41,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:24:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:24:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:24:41,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:24:41,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586712343] [2021-11-06 10:24:41,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586712343] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:24:41,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:24:41,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:24:41,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006567745] [2021-11-06 10:24:41,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:24:41,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:24:41,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:24:41,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:24:41,644 INFO L87 Difference]: Start difference. First operand 915 states and 1060 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:24:49,243 INFO L93 Difference]: Finished difference Result 1214 states and 1386 transitions. [2021-11-06 10:24:49,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:24:49,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-06 10:24:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:24:49,246 INFO L225 Difference]: With dead ends: 1214 [2021-11-06 10:24:49,246 INFO L226 Difference]: Without dead ends: 1088 [2021-11-06 10:24:49,246 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:24:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-11-06 10:24:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 909. [2021-11-06 10:24:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 903 states have (on average 1.1627906976744187) internal successors, (1050), 908 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1050 transitions. [2021-11-06 10:24:49,308 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1050 transitions. Word has length 94 [2021-11-06 10:24:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:24:49,308 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1050 transitions. [2021-11-06 10:24:49,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:24:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1050 transitions. [2021-11-06 10:24:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-06 10:24:49,309 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:24:49,309 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:24:49,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-06 10:24:49,309 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:24:49,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:24:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -252867351, now seen corresponding path program 1 times [2021-11-06 10:24:49,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:24:49,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571173445] [2021-11-06 10:24:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:24:49,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:24:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:24:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:24:52,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:24:52,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571173445] [2021-11-06 10:24:52,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571173445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:24:52,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:24:52,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:24:52,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636723385] [2021-11-06 10:24:52,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:24:52,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:24:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:24:52,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:24:52,548 INFO L87 Difference]: Start difference. First operand 909 states and 1050 transitions. Second operand has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:25:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:25:23,955 INFO L93 Difference]: Finished difference Result 1651 states and 1868 transitions. [2021-11-06 10:25:23,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-11-06 10:25:23,955 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-06 10:25:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:25:23,957 INFO L225 Difference]: With dead ends: 1651 [2021-11-06 10:25:23,957 INFO L226 Difference]: Without dead ends: 1573 [2021-11-06 10:25:23,959 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3229 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=2036, Invalid=9306, Unknown=0, NotChecked=0, Total=11342 [2021-11-06 10:25:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2021-11-06 10:25:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 991. [2021-11-06 10:25:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 986 states have (on average 1.167342799188641) internal successors, (1151), 990 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:25:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1151 transitions. [2021-11-06 10:25:24,029 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1151 transitions. Word has length 94 [2021-11-06 10:25:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:25:24,029 INFO L470 AbstractCegarLoop]: Abstraction has 991 states and 1151 transitions. [2021-11-06 10:25:24,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:25:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1151 transitions. [2021-11-06 10:25:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 10:25:24,030 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:25:24,030 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:25:24,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-06 10:25:24,030 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:25:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:25:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 135454582, now seen corresponding path program 1 times [2021-11-06 10:25:24,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:25:24,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47138339] [2021-11-06 10:25:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:25:24,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:25:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:25:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:25:24,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:25:24,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47138339] [2021-11-06 10:25:24,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47138339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:25:24,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:25:24,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:25:24,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780788670] [2021-11-06 10:25:24,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:25:24,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:25:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:25:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:25:24,364 INFO L87 Difference]: Start difference. First operand 991 states and 1151 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:25:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:25:25,546 INFO L93 Difference]: Finished difference Result 1175 states and 1353 transitions. [2021-11-06 10:25:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:25:25,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 10:25:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:25:25,550 INFO L225 Difference]: With dead ends: 1175 [2021-11-06 10:25:25,550 INFO L226 Difference]: Without dead ends: 1134 [2021-11-06 10:25:25,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:25:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2021-11-06 10:25:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 989. [2021-11-06 10:25:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 984 states have (on average 1.1656504065040652) internal successors, (1147), 988 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:25:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1147 transitions. [2021-11-06 10:25:25,627 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1147 transitions. Word has length 95 [2021-11-06 10:25:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:25:25,627 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1147 transitions. [2021-11-06 10:25:25,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:25:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1147 transitions. [2021-11-06 10:25:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 10:25:25,628 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:25:25,629 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:25:25,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-06 10:25:25,629 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:25:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:25:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1064569996, now seen corresponding path program 1 times [2021-11-06 10:25:25,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:25:25,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159004793] [2021-11-06 10:25:25,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:25:25,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:25:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:25:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:25:26,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:25:26,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159004793] [2021-11-06 10:25:26,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159004793] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:25:26,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:25:26,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:25:26,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948016252] [2021-11-06 10:25:26,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:25:26,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:25:26,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:25:26,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:25:26,305 INFO L87 Difference]: Start difference. First operand 989 states and 1147 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:25:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:25:36,165 INFO L93 Difference]: Finished difference Result 1410 states and 1607 transitions. [2021-11-06 10:25:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 10:25:36,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 10:25:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:25:36,168 INFO L225 Difference]: With dead ends: 1410 [2021-11-06 10:25:36,168 INFO L226 Difference]: Without dead ends: 1328 [2021-11-06 10:25:36,168 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2021-11-06 10:25:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2021-11-06 10:25:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1115. [2021-11-06 10:25:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1110 states have (on average 1.1567567567567567) internal successors, (1284), 1114 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:25:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1284 transitions. [2021-11-06 10:25:36,250 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1284 transitions. Word has length 95 [2021-11-06 10:25:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:25:36,251 INFO L470 AbstractCegarLoop]: Abstraction has 1115 states and 1284 transitions. [2021-11-06 10:25:36,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:25:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1284 transitions. [2021-11-06 10:25:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 10:25:36,251 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:25:36,251 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:25:36,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-06 10:25:36,252 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:25:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:25:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash -806404558, now seen corresponding path program 1 times [2021-11-06 10:25:36,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:25:36,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95964762] [2021-11-06 10:25:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:25:36,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:25:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:25:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:25:41,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:25:41,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95964762] [2021-11-06 10:25:41,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95964762] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:25:41,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:25:41,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:25:41,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812408561] [2021-11-06 10:25:41,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:25:41,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:25:41,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:25:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:25:41,578 INFO L87 Difference]: Start difference. First operand 1115 states and 1284 transitions. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:26:10,650 INFO L93 Difference]: Finished difference Result 1486 states and 1677 transitions. [2021-11-06 10:26:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-06 10:26:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 10:26:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:26:10,652 INFO L225 Difference]: With dead ends: 1486 [2021-11-06 10:26:10,652 INFO L226 Difference]: Without dead ends: 1455 [2021-11-06 10:26:10,653 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1105, Invalid=5375, Unknown=0, NotChecked=0, Total=6480 [2021-11-06 10:26:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2021-11-06 10:26:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1113. [2021-11-06 10:26:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1108 states have (on average 1.1561371841155235) internal successors, (1281), 1112 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1281 transitions. [2021-11-06 10:26:10,735 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1281 transitions. Word has length 95 [2021-11-06 10:26:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:26:10,736 INFO L470 AbstractCegarLoop]: Abstraction has 1113 states and 1281 transitions. [2021-11-06 10:26:10,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1281 transitions. [2021-11-06 10:26:10,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 10:26:10,737 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:26:10,737 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:26:10,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-06 10:26:10,737 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:26:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:26:10,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1162735838, now seen corresponding path program 1 times [2021-11-06 10:26:10,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:26:10,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726467659] [2021-11-06 10:26:10,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:26:10,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:26:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:26:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:26:15,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:26:15,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726467659] [2021-11-06 10:26:15,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726467659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:26:15,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:26:15,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:26:15,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435202180] [2021-11-06 10:26:15,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:26:15,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:26:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:26:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:26:15,902 INFO L87 Difference]: Start difference. First operand 1113 states and 1281 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:26:36,718 INFO L93 Difference]: Finished difference Result 1579 states and 1801 transitions. [2021-11-06 10:26:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-06 10:26:36,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-06 10:26:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:26:36,720 INFO L225 Difference]: With dead ends: 1579 [2021-11-06 10:26:36,721 INFO L226 Difference]: Without dead ends: 1577 [2021-11-06 10:26:36,721 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:26:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2021-11-06 10:26:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1121. [2021-11-06 10:26:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1116 states have (on average 1.1559139784946237) internal successors, (1290), 1120 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1290 transitions. [2021-11-06 10:26:36,811 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1290 transitions. Word has length 99 [2021-11-06 10:26:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:26:36,811 INFO L470 AbstractCegarLoop]: Abstraction has 1121 states and 1290 transitions. [2021-11-06 10:26:36,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1290 transitions. [2021-11-06 10:26:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-06 10:26:36,812 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:26:36,813 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:26:36,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-06 10:26:36,813 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:26:36,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:26:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1773074330, now seen corresponding path program 1 times [2021-11-06 10:26:36,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:26:36,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613737876] [2021-11-06 10:26:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:26:36,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:26:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:26:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:26:37,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:26:37,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613737876] [2021-11-06 10:26:37,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613737876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:26:37,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:26:37,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:26:37,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8380869] [2021-11-06 10:26:37,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:26:37,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:26:37,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:26:37,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:26:37,052 INFO L87 Difference]: Start difference. First operand 1121 states and 1290 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:26:37,247 INFO L93 Difference]: Finished difference Result 1516 states and 1742 transitions. [2021-11-06 10:26:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:26:37,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-06 10:26:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:26:37,249 INFO L225 Difference]: With dead ends: 1516 [2021-11-06 10:26:37,249 INFO L226 Difference]: Without dead ends: 831 [2021-11-06 10:26:37,249 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:26:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2021-11-06 10:26:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 708. [2021-11-06 10:26:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 703 states have (on average 1.1479374110953058) internal successors, (807), 707 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 807 transitions. [2021-11-06 10:26:37,300 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 807 transitions. Word has length 101 [2021-11-06 10:26:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:26:37,301 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 807 transitions. [2021-11-06 10:26:37,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 807 transitions. [2021-11-06 10:26:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 10:26:37,301 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:26:37,302 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:26:37,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-06 10:26:37,302 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:26:37,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:26:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash 559822594, now seen corresponding path program 1 times [2021-11-06 10:26:37,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:26:37,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076900743] [2021-11-06 10:26:37,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:26:37,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:26:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:26:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:26:40,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:26:40,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076900743] [2021-11-06 10:26:40,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076900743] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:26:40,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:26:40,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:26:40,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420409415] [2021-11-06 10:26:40,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:26:40,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:26:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:26:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:26:40,008 INFO L87 Difference]: Start difference. First operand 708 states and 807 transitions. Second operand has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:26:48,622 INFO L93 Difference]: Finished difference Result 939 states and 1058 transitions. [2021-11-06 10:26:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:26:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 10:26:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:26:48,624 INFO L225 Difference]: With dead ends: 939 [2021-11-06 10:26:48,624 INFO L226 Difference]: Without dead ends: 937 [2021-11-06 10:26:48,624 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:26:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2021-11-06 10:26:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 716. [2021-11-06 10:26:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 711 states have (on average 1.1448663853727146) internal successors, (814), 715 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 814 transitions. [2021-11-06 10:26:48,678 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 814 transitions. Word has length 103 [2021-11-06 10:26:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:26:48,679 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 814 transitions. [2021-11-06 10:26:48,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 814 transitions. [2021-11-06 10:26:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-06 10:26:48,679 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:26:48,680 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:26:48,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-06 10:26:48,680 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:26:48,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:26:48,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1142405382, now seen corresponding path program 1 times [2021-11-06 10:26:48,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:26:48,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552452729] [2021-11-06 10:26:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:26:48,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:26:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:26:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:26:48,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:26:48,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552452729] [2021-11-06 10:26:48,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552452729] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:26:48,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:26:48,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:26:48,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225345190] [2021-11-06 10:26:48,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:26:48,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:26:48,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:26:48,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:26:48,843 INFO L87 Difference]: Start difference. First operand 716 states and 814 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:26:48,976 INFO L93 Difference]: Finished difference Result 1201 states and 1363 transitions. [2021-11-06 10:26:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:26:48,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-11-06 10:26:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:26:48,978 INFO L225 Difference]: With dead ends: 1201 [2021-11-06 10:26:48,978 INFO L226 Difference]: Without dead ends: 1060 [2021-11-06 10:26:48,979 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:26:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2021-11-06 10:26:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 722. [2021-11-06 10:26:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 717 states have (on average 1.1436541143654115) internal successors, (820), 721 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 820 transitions. [2021-11-06 10:26:49,033 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 820 transitions. Word has length 106 [2021-11-06 10:26:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:26:49,033 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 820 transitions. [2021-11-06 10:26:49,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 820 transitions. [2021-11-06 10:26:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-06 10:26:49,034 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:26:49,034 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:26:49,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-06 10:26:49,035 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:26:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:26:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 391613226, now seen corresponding path program 1 times [2021-11-06 10:26:49,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:26:49,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062418455] [2021-11-06 10:26:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:26:49,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:26:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:26:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:26:49,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:26:49,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062418455] [2021-11-06 10:26:49,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062418455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:26:49,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:26:49,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:26:49,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11585477] [2021-11-06 10:26:49,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:26:49,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:26:49,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:26:49,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:26:49,210 INFO L87 Difference]: Start difference. First operand 722 states and 820 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:26:49,330 INFO L93 Difference]: Finished difference Result 868 states and 983 transitions. [2021-11-06 10:26:49,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:26:49,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-11-06 10:26:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:26:49,332 INFO L225 Difference]: With dead ends: 868 [2021-11-06 10:26:49,332 INFO L226 Difference]: Without dead ends: 675 [2021-11-06 10:26:49,332 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:26:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2021-11-06 10:26:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 613. [2021-11-06 10:26:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 608 states have (on average 1.1266447368421053) internal successors, (685), 612 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 685 transitions. [2021-11-06 10:26:49,380 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 685 transitions. Word has length 108 [2021-11-06 10:26:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:26:49,380 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 685 transitions. [2021-11-06 10:26:49,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 685 transitions. [2021-11-06 10:26:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-06 10:26:49,381 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:26:49,381 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:26:49,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-06 10:26:49,382 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:26:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:26:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash 748826966, now seen corresponding path program 1 times [2021-11-06 10:26:49,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:26:49,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299824180] [2021-11-06 10:26:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:26:49,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:26:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:26:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:26:49,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:26:49,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299824180] [2021-11-06 10:26:49,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299824180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:26:49,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:26:49,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 10:26:49,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724184318] [2021-11-06 10:26:49,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 10:26:49,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:26:49,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 10:26:49,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:26:49,771 INFO L87 Difference]: Start difference. First operand 613 states and 685 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:26:49,830 INFO L93 Difference]: Finished difference Result 790 states and 885 transitions. [2021-11-06 10:26:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 10:26:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-06 10:26:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:26:49,831 INFO L225 Difference]: With dead ends: 790 [2021-11-06 10:26:49,831 INFO L226 Difference]: Without dead ends: 643 [2021-11-06 10:26:49,831 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:26:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-11-06 10:26:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 607. [2021-11-06 10:26:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.1212624584717608) internal successors, (675), 606 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 675 transitions. [2021-11-06 10:26:49,877 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 675 transitions. Word has length 109 [2021-11-06 10:26:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:26:49,877 INFO L470 AbstractCegarLoop]: Abstraction has 607 states and 675 transitions. [2021-11-06 10:26:49,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 675 transitions. [2021-11-06 10:26:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-06 10:26:49,878 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:26:49,878 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:26:49,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-06 10:26:49,878 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:26:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:26:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash -911345929, now seen corresponding path program 1 times [2021-11-06 10:26:49,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:26:49,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019254421] [2021-11-06 10:26:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:26:49,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:26:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:26:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:26:50,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:26:50,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019254421] [2021-11-06 10:26:50,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019254421] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:26:50,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:26:50,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:26:50,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874238825] [2021-11-06 10:26:50,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:26:50,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:26:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:26:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:26:50,058 INFO L87 Difference]: Start difference. First operand 607 states and 675 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:26:50,176 INFO L93 Difference]: Finished difference Result 903 states and 1000 transitions. [2021-11-06 10:26:50,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:26:50,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-11-06 10:26:50,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:26:50,178 INFO L225 Difference]: With dead ends: 903 [2021-11-06 10:26:50,178 INFO L226 Difference]: Without dead ends: 762 [2021-11-06 10:26:50,178 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:26:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2021-11-06 10:26:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 610. [2021-11-06 10:26:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 605 states have (on average 1.1206611570247933) internal successors, (678), 609 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 678 transitions. [2021-11-06 10:26:50,223 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 678 transitions. Word has length 110 [2021-11-06 10:26:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:26:50,223 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 678 transitions. [2021-11-06 10:26:50,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 678 transitions. [2021-11-06 10:26:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-06 10:26:50,224 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:26:50,224 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:26:50,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-06 10:26:50,224 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:26:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:26:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1817647446, now seen corresponding path program 1 times [2021-11-06 10:26:50,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:26:50,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56326133] [2021-11-06 10:26:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:26:50,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:26:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:26:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:26:50,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:26:50,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56326133] [2021-11-06 10:26:50,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56326133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:26:50,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:26:50,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:26:50,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954211373] [2021-11-06 10:26:50,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:26:50,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:26:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:26:50,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:26:50,686 INFO L87 Difference]: Start difference. First operand 610 states and 678 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:26:50,789 INFO L93 Difference]: Finished difference Result 883 states and 981 transitions. [2021-11-06 10:26:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:26:50,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-11-06 10:26:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:26:50,791 INFO L225 Difference]: With dead ends: 883 [2021-11-06 10:26:50,791 INFO L226 Difference]: Without dead ends: 634 [2021-11-06 10:26:50,791 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:26:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2021-11-06 10:26:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 598. [2021-11-06 10:26:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 593 states have (on average 1.1129848229342327) internal successors, (660), 597 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 660 transitions. [2021-11-06 10:26:50,836 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 660 transitions. Word has length 111 [2021-11-06 10:26:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:26:50,836 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 660 transitions. [2021-11-06 10:26:50,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:26:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 660 transitions. [2021-11-06 10:26:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 10:26:50,837 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:26:50,837 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:26:50,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-06 10:26:50,837 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:26:50,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:26:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -908478147, now seen corresponding path program 1 times [2021-11-06 10:26:50,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:26:50,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201868942] [2021-11-06 10:26:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:26:50,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:26:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:26:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:26:53,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:26:53,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201868942] [2021-11-06 10:26:53,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201868942] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:26:53,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:26:53,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:26:53,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672614644] [2021-11-06 10:26:53,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:26:53,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:26:53,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:26:53,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:26:53,516 INFO L87 Difference]: Start difference. First operand 598 states and 660 transitions. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:27:10,033 INFO L93 Difference]: Finished difference Result 945 states and 1036 transitions. [2021-11-06 10:27:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:27:10,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-06 10:27:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:27:10,035 INFO L225 Difference]: With dead ends: 945 [2021-11-06 10:27:10,035 INFO L226 Difference]: Without dead ends: 702 [2021-11-06 10:27:10,035 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:27:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-11-06 10:27:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 585. [2021-11-06 10:27:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 580 states have (on average 1.1051724137931034) internal successors, (641), 584 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 641 transitions. [2021-11-06 10:27:10,079 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 641 transitions. Word has length 112 [2021-11-06 10:27:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:27:10,079 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 641 transitions. [2021-11-06 10:27:10,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 641 transitions. [2021-11-06 10:27:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 10:27:10,080 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:27:10,080 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:27:10,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-06 10:27:10,080 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:27:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:27:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -689623429, now seen corresponding path program 1 times [2021-11-06 10:27:10,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:27:10,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513667420] [2021-11-06 10:27:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:27:10,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:27:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:27:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:27:17,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:27:17,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513667420] [2021-11-06 10:27:17,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513667420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:27:17,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:27:17,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:27:17,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122975313] [2021-11-06 10:27:17,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:27:17,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:27:17,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:27:17,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:27:17,235 INFO L87 Difference]: Start difference. First operand 585 states and 641 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:27:20,862 INFO L93 Difference]: Finished difference Result 798 states and 863 transitions. [2021-11-06 10:27:20,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 10:27:20,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-06 10:27:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:27:20,864 INFO L225 Difference]: With dead ends: 798 [2021-11-06 10:27:20,864 INFO L226 Difference]: Without dead ends: 738 [2021-11-06 10:27:20,865 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2021-11-06 10:27:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-11-06 10:27:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 571. [2021-11-06 10:27:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 566 states have (on average 1.1007067137809188) internal successors, (623), 570 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 623 transitions. [2021-11-06 10:27:20,909 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 623 transitions. Word has length 112 [2021-11-06 10:27:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:27:20,909 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 623 transitions. [2021-11-06 10:27:20,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 623 transitions. [2021-11-06 10:27:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 10:27:20,910 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:27:20,910 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:27:20,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-06 10:27:20,910 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:27:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:27:20,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2122633611, now seen corresponding path program 1 times [2021-11-06 10:27:20,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:27:20,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943301939] [2021-11-06 10:27:20,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:27:20,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:27:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:27:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:27:22,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:27:22,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943301939] [2021-11-06 10:27:22,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943301939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:27:22,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:27:22,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:27:22,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152232205] [2021-11-06 10:27:22,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:27:22,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:27:22,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:27:22,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:27:22,280 INFO L87 Difference]: Start difference. First operand 571 states and 623 transitions. Second operand has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:27:41,042 INFO L93 Difference]: Finished difference Result 920 states and 1003 transitions. [2021-11-06 10:27:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-06 10:27:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-06 10:27:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:27:41,043 INFO L225 Difference]: With dead ends: 920 [2021-11-06 10:27:41,043 INFO L226 Difference]: Without dead ends: 862 [2021-11-06 10:27:41,044 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2021-11-06 10:27:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-11-06 10:27:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 596. [2021-11-06 10:27:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 591 states have (on average 1.101522842639594) internal successors, (651), 595 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 651 transitions. [2021-11-06 10:27:41,110 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 651 transitions. Word has length 112 [2021-11-06 10:27:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:27:41,111 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 651 transitions. [2021-11-06 10:27:41,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 651 transitions. [2021-11-06 10:27:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 10:27:41,116 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:27:41,116 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:27:41,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-06 10:27:41,116 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:27:41,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:27:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476549, now seen corresponding path program 1 times [2021-11-06 10:27:41,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:27:41,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187391310] [2021-11-06 10:27:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:27:41,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:27:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:27:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:27:41,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:27:41,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187391310] [2021-11-06 10:27:41,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187391310] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:27:41,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:27:41,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:27:41,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227593446] [2021-11-06 10:27:41,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:27:41,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:27:41,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:27:41,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:27:41,285 INFO L87 Difference]: Start difference. First operand 596 states and 651 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:27:41,401 INFO L93 Difference]: Finished difference Result 647 states and 704 transitions. [2021-11-06 10:27:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:27:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-06 10:27:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:27:41,403 INFO L225 Difference]: With dead ends: 647 [2021-11-06 10:27:41,403 INFO L226 Difference]: Without dead ends: 561 [2021-11-06 10:27:41,403 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:27:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-11-06 10:27:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 543. [2021-11-06 10:27:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 538 states have (on average 1.0929368029739777) internal successors, (588), 542 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 588 transitions. [2021-11-06 10:27:41,450 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 588 transitions. Word has length 112 [2021-11-06 10:27:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:27:41,450 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 588 transitions. [2021-11-06 10:27:41,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:27:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 588 transitions. [2021-11-06 10:27:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 10:27:41,451 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:27:41,451 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:27:41,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-06 10:27:41,452 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:27:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:27:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2035755465, now seen corresponding path program 1 times [2021-11-06 10:27:41,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:27:41,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741397039] [2021-11-06 10:27:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:27:41,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:27:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:27:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:27:53,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:27:53,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741397039] [2021-11-06 10:27:53,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741397039] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:27:53,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:27:53,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-11-06 10:27:53,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302752487] [2021-11-06 10:27:53,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-06 10:27:53,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:27:53,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-06 10:27:53,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2021-11-06 10:27:53,554 INFO L87 Difference]: Start difference. First operand 543 states and 588 transitions. Second operand has 35 states, 35 states have (on average 3.2) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:28:37,764 INFO L93 Difference]: Finished difference Result 780 states and 834 transitions. [2021-11-06 10:28:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-06 10:28:37,764 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.2) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-06 10:28:37,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:28:37,765 INFO L225 Difference]: With dead ends: 780 [2021-11-06 10:28:37,765 INFO L226 Difference]: Without dead ends: 733 [2021-11-06 10:28:37,766 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1029, Invalid=4227, Unknown=0, NotChecked=0, Total=5256 [2021-11-06 10:28:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-11-06 10:28:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 527. [2021-11-06 10:28:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 522 states have (on average 1.0919540229885059) internal successors, (570), 526 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 570 transitions. [2021-11-06 10:28:37,813 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 570 transitions. Word has length 112 [2021-11-06 10:28:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:28:37,813 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 570 transitions. [2021-11-06 10:28:37,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.2) internal successors, (112), 34 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 570 transitions. [2021-11-06 10:28:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-06 10:28:37,814 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:28:37,814 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:28:37,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-06 10:28:37,814 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:28:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:28:37,814 INFO L85 PathProgramCache]: Analyzing trace with hash 688839446, now seen corresponding path program 1 times [2021-11-06 10:28:37,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:28:37,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309030155] [2021-11-06 10:28:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:28:37,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:28:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:28:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:28:38,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:28:38,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309030155] [2021-11-06 10:28:38,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309030155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:28:38,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:28:38,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:28:38,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703631391] [2021-11-06 10:28:38,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:28:38,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:28:38,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:28:38,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:28:38,007 INFO L87 Difference]: Start difference. First operand 527 states and 570 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:28:38,151 INFO L93 Difference]: Finished difference Result 612 states and 664 transitions. [2021-11-06 10:28:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:28:38,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-11-06 10:28:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:28:38,152 INFO L225 Difference]: With dead ends: 612 [2021-11-06 10:28:38,152 INFO L226 Difference]: Without dead ends: 563 [2021-11-06 10:28:38,153 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:28:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-11-06 10:28:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 527. [2021-11-06 10:28:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 522 states have (on average 1.082375478927203) internal successors, (565), 526 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 565 transitions. [2021-11-06 10:28:38,207 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 565 transitions. Word has length 113 [2021-11-06 10:28:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:28:38,208 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 565 transitions. [2021-11-06 10:28:38,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 565 transitions. [2021-11-06 10:28:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-06 10:28:38,208 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:28:38,208 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:28:38,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-06 10:28:38,209 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:28:38,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:28:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash 566323022, now seen corresponding path program 1 times [2021-11-06 10:28:38,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:28:38,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738435213] [2021-11-06 10:28:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:28:38,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:28:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:28:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:28:40,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:28:40,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738435213] [2021-11-06 10:28:40,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738435213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:28:40,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:28:40,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 10:28:40,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4396367] [2021-11-06 10:28:40,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 10:28:40,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:28:40,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 10:28:40,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:28:40,377 INFO L87 Difference]: Start difference. First operand 527 states and 565 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:28:58,692 INFO L93 Difference]: Finished difference Result 739 states and 778 transitions. [2021-11-06 10:28:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-06 10:28:58,692 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2021-11-06 10:28:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:28:58,693 INFO L225 Difference]: With dead ends: 739 [2021-11-06 10:28:58,694 INFO L226 Difference]: Without dead ends: 669 [2021-11-06 10:28:58,694 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2021-11-06 10:28:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2021-11-06 10:28:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 518. [2021-11-06 10:28:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 513 states have (on average 1.0799220272904484) internal successors, (554), 517 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 554 transitions. [2021-11-06 10:28:58,740 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 554 transitions. Word has length 114 [2021-11-06 10:28:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:28:58,740 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 554 transitions. [2021-11-06 10:28:58,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 554 transitions. [2021-11-06 10:28:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-06 10:28:58,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:28:58,741 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:28:58,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-06 10:28:58,741 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:28:58,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:28:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash -330335905, now seen corresponding path program 1 times [2021-11-06 10:28:58,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:28:58,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533979169] [2021-11-06 10:28:58,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:28:58,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:28:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:28:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:28:58,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:28:58,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533979169] [2021-11-06 10:28:58,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533979169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:28:58,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:28:58,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:28:58,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248308685] [2021-11-06 10:28:58,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:28:58,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:28:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:28:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:28:58,953 INFO L87 Difference]: Start difference. First operand 518 states and 554 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:28:59,130 INFO L93 Difference]: Finished difference Result 604 states and 643 transitions. [2021-11-06 10:28:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:28:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2021-11-06 10:28:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:28:59,132 INFO L225 Difference]: With dead ends: 604 [2021-11-06 10:28:59,132 INFO L226 Difference]: Without dead ends: 480 [2021-11-06 10:28:59,132 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:28:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-11-06 10:28:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 462. [2021-11-06 10:28:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 458 states have (on average 1.0633187772925765) internal successors, (487), 461 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 487 transitions. [2021-11-06 10:28:59,173 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 487 transitions. Word has length 114 [2021-11-06 10:28:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:28:59,173 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 487 transitions. [2021-11-06 10:28:59,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:28:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 487 transitions. [2021-11-06 10:28:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-06 10:28:59,174 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:28:59,174 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:28:59,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-06 10:28:59,174 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:28:59,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:28:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1490036210, now seen corresponding path program 1 times [2021-11-06 10:28:59,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:28:59,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961960850] [2021-11-06 10:28:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:28:59,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:28:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:29:00,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:00,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961960850] [2021-11-06 10:29:00,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961960850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:00,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:00,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:29:00,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343359686] [2021-11-06 10:29:00,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:29:00,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:00,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:29:00,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:29:00,806 INFO L87 Difference]: Start difference. First operand 462 states and 487 transitions. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:13,220 INFO L93 Difference]: Finished difference Result 607 states and 638 transitions. [2021-11-06 10:29:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:29:13,220 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2021-11-06 10:29:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:13,221 INFO L225 Difference]: With dead ends: 607 [2021-11-06 10:29:13,221 INFO L226 Difference]: Without dead ends: 407 [2021-11-06 10:29:13,221 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2021-11-06 10:29:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-11-06 10:29:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 384. [2021-11-06 10:29:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 380 states have (on average 1.055263157894737) internal successors, (401), 383 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 401 transitions. [2021-11-06 10:29:13,255 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 401 transitions. Word has length 114 [2021-11-06 10:29:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:13,255 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 401 transitions. [2021-11-06 10:29:13,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 401 transitions. [2021-11-06 10:29:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-06 10:29:13,256 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:13,256 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:29:13,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-06 10:29:13,256 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:29:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1843124592, now seen corresponding path program 1 times [2021-11-06 10:29:13,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:13,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398400255] [2021-11-06 10:29:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:13,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:29:20,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:20,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398400255] [2021-11-06 10:29:20,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398400255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:20,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:20,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:29:20,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415577278] [2021-11-06 10:29:20,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:29:20,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:20,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:29:20,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:29:20,370 INFO L87 Difference]: Start difference. First operand 384 states and 401 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:29,924 INFO L93 Difference]: Finished difference Result 449 states and 466 transitions. [2021-11-06 10:29:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-06 10:29:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2021-11-06 10:29:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:29,926 INFO L225 Difference]: With dead ends: 449 [2021-11-06 10:29:29,926 INFO L226 Difference]: Without dead ends: 447 [2021-11-06 10:29:29,927 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1099, Invalid=4303, Unknown=0, NotChecked=0, Total=5402 [2021-11-06 10:29:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-11-06 10:29:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 382. [2021-11-06 10:29:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 379 states have (on average 1.0527704485488127) internal successors, (399), 381 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 399 transitions. [2021-11-06 10:29:29,962 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 399 transitions. Word has length 114 [2021-11-06 10:29:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:29,962 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 399 transitions. [2021-11-06 10:29:29,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 399 transitions. [2021-11-06 10:29:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-06 10:29:29,963 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:29,963 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:29:29,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-06 10:29:29,963 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:29:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash 987673239, now seen corresponding path program 1 times [2021-11-06 10:29:29,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:29,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869994506] [2021-11-06 10:29:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:29,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:29:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:29:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:29:32,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:29:32,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869994506] [2021-11-06 10:29:32,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869994506] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:29:32,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:29:32,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-06 10:29:32,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149836960] [2021-11-06 10:29:32,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-06 10:29:32,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:29:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-06 10:29:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:29:32,693 INFO L87 Difference]: Start difference. First operand 382 states and 399 transitions. Second operand has 17 states, 17 states have (on average 7.0) internal successors, (119), 17 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:29:58,853 INFO L93 Difference]: Finished difference Result 512 states and 530 transitions. [2021-11-06 10:29:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-06 10:29:58,853 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.0) internal successors, (119), 17 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-11-06 10:29:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:29:58,854 INFO L225 Difference]: With dead ends: 512 [2021-11-06 10:29:58,854 INFO L226 Difference]: Without dead ends: 510 [2021-11-06 10:29:58,854 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2021-11-06 10:29:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-11-06 10:29:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 380. [2021-11-06 10:29:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 378 states have (on average 1.0476190476190477) internal successors, (396), 379 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 396 transitions. [2021-11-06 10:29:58,889 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 396 transitions. Word has length 119 [2021-11-06 10:29:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:29:58,889 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 396 transitions. [2021-11-06 10:29:58,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.0) internal successors, (119), 17 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:29:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 396 transitions. [2021-11-06 10:29:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-06 10:29:58,890 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:29:58,890 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:29:58,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-06 10:29:58,891 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:29:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:29:58,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1646402588, now seen corresponding path program 1 times [2021-11-06 10:29:58,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:29:58,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24251599] [2021-11-06 10:29:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:29:58,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:30:03,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:03,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24251599] [2021-11-06 10:30:03,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24251599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:03,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:03,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:30:03,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933384104] [2021-11-06 10:30:03,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:30:03,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:03,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:30:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:30:03,527 INFO L87 Difference]: Start difference. First operand 380 states and 396 transitions. Second operand has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 14 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:16,455 INFO L93 Difference]: Finished difference Result 410 states and 423 transitions. [2021-11-06 10:30:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 10:30:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 14 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-11-06 10:30:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:16,456 INFO L225 Difference]: With dead ends: 410 [2021-11-06 10:30:16,456 INFO L226 Difference]: Without dead ends: 394 [2021-11-06 10:30:16,456 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:30:16,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-06 10:30:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 349. [2021-11-06 10:30:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 347 states have (on average 1.0461095100864553) internal successors, (363), 348 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 363 transitions. [2021-11-06 10:30:16,486 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 363 transitions. Word has length 119 [2021-11-06 10:30:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:16,486 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 363 transitions. [2021-11-06 10:30:16,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 14 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 363 transitions. [2021-11-06 10:30:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-06 10:30:16,487 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:16,487 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:30:16,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-06 10:30:16,487 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:30:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash 224555543, now seen corresponding path program 1 times [2021-11-06 10:30:16,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:16,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076637052] [2021-11-06 10:30:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:16,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:30:17,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:17,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076637052] [2021-11-06 10:30:17,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076637052] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:17,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:17,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:30:17,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714763413] [2021-11-06 10:30:17,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:30:17,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:17,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:30:17,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:30:17,285 INFO L87 Difference]: Start difference. First operand 349 states and 363 transitions. Second operand has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:30:33,203 INFO L93 Difference]: Finished difference Result 421 states and 433 transitions. [2021-11-06 10:30:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-06 10:30:33,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-11-06 10:30:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:30:33,204 INFO L225 Difference]: With dead ends: 421 [2021-11-06 10:30:33,205 INFO L226 Difference]: Without dead ends: 349 [2021-11-06 10:30:33,205 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:30:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-06 10:30:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 327. [2021-11-06 10:30:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 325 states have (on average 1.04) internal successors, (338), 326 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 338 transitions. [2021-11-06 10:30:33,233 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 338 transitions. Word has length 121 [2021-11-06 10:30:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:30:33,233 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 338 transitions. [2021-11-06 10:30:33,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:30:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 338 transitions. [2021-11-06 10:30:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-06 10:30:33,234 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:30:33,234 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:30:33,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-06 10:30:33,234 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:30:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:30:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1626989591, now seen corresponding path program 1 times [2021-11-06 10:30:33,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:30:33,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074337822] [2021-11-06 10:30:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:30:33,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:30:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:30:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:30:39,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:30:39,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074337822] [2021-11-06 10:30:39,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074337822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:30:39,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:30:39,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-11-06 10:30:39,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035446792] [2021-11-06 10:30:39,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-06 10:30:39,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:30:39,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-06 10:30:39,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:30:39,368 INFO L87 Difference]: Start difference. First operand 327 states and 338 transitions. Second operand has 25 states, 25 states have (on average 4.84) internal successors, (121), 25 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:12,910 INFO L93 Difference]: Finished difference Result 338 states and 347 transitions. [2021-11-06 10:31:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-06 10:31:12,911 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.84) internal successors, (121), 25 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-11-06 10:31:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:12,911 INFO L225 Difference]: With dead ends: 338 [2021-11-06 10:31:12,911 INFO L226 Difference]: Without dead ends: 266 [2021-11-06 10:31:12,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=653, Invalid=3769, Unknown=0, NotChecked=0, Total=4422 [2021-11-06 10:31:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-06 10:31:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2021-11-06 10:31:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 262 states have (on average 1.0381679389312977) internal successors, (272), 263 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 272 transitions. [2021-11-06 10:31:12,932 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 272 transitions. Word has length 121 [2021-11-06 10:31:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:12,932 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 272 transitions. [2021-11-06 10:31:12,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.84) internal successors, (121), 25 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 272 transitions. [2021-11-06 10:31:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-06 10:31:12,932 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:12,932 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:31:12,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-06 10:31:12,933 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:31:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2027254843, now seen corresponding path program 1 times [2021-11-06 10:31:12,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:12,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166296113] [2021-11-06 10:31:12,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:12,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:31:20,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:20,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166296113] [2021-11-06 10:31:20,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166296113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:20,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:20,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-06 10:31:20,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468386826] [2021-11-06 10:31:20,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-06 10:31:20,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:20,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-06 10:31:20,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-11-06 10:31:20,930 INFO L87 Difference]: Start difference. First operand 264 states and 272 transitions. Second operand has 20 states, 20 states have (on average 6.15) internal successors, (123), 20 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:36,557 INFO L93 Difference]: Finished difference Result 264 states and 272 transitions. [2021-11-06 10:31:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 10:31:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.15) internal successors, (123), 20 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2021-11-06 10:31:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:36,558 INFO L225 Difference]: With dead ends: 264 [2021-11-06 10:31:36,558 INFO L226 Difference]: Without dead ends: 262 [2021-11-06 10:31:36,558 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2021-11-06 10:31:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-06 10:31:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-11-06 10:31:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.0306513409961686) internal successors, (269), 261 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 269 transitions. [2021-11-06 10:31:36,578 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 269 transitions. Word has length 123 [2021-11-06 10:31:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:36,579 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 269 transitions. [2021-11-06 10:31:36,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.15) internal successors, (123), 20 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 269 transitions. [2021-11-06 10:31:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-06 10:31:36,579 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:36,579 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:31:36,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-06 10:31:36,580 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:31:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1760719075, now seen corresponding path program 1 times [2021-11-06 10:31:36,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:36,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736563488] [2021-11-06 10:31:36,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:36,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:31:41,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:41,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736563488] [2021-11-06 10:31:41,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736563488] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:41,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:41,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:31:41,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893311824] [2021-11-06 10:31:41,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:31:41,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:31:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:31:41,927 INFO L87 Difference]: Start difference. First operand 262 states and 269 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 14 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:31:58,639 INFO L93 Difference]: Finished difference Result 271 states and 277 transitions. [2021-11-06 10:31:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 10:31:58,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 14 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2021-11-06 10:31:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:31:58,640 INFO L225 Difference]: With dead ends: 271 [2021-11-06 10:31:58,640 INFO L226 Difference]: Without dead ends: 255 [2021-11-06 10:31:58,641 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:31:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-06 10:31:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-11-06 10:31:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.0196850393700787) internal successors, (259), 254 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 259 transitions. [2021-11-06 10:31:58,661 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 259 transitions. Word has length 139 [2021-11-06 10:31:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:31:58,662 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 259 transitions. [2021-11-06 10:31:58,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 14 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:31:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 259 transitions. [2021-11-06 10:31:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-06 10:31:58,662 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:31:58,663 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:31:58,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-06 10:31:58,663 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:31:58,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:31:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1101238039, now seen corresponding path program 1 times [2021-11-06 10:31:58,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:31:58,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902097782] [2021-11-06 10:31:58,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:31:58,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:31:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:31:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:31:59,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:31:59,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902097782] [2021-11-06 10:31:59,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902097782] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:31:59,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:31:59,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:31:59,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707028137] [2021-11-06 10:31:59,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:31:59,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:31:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:31:59,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:31:59,998 INFO L87 Difference]: Start difference. First operand 255 states and 259 transitions. Second operand has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:32:10,854 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2021-11-06 10:32:10,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-06 10:32:10,855 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2021-11-06 10:32:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:32:10,855 INFO L225 Difference]: With dead ends: 262 [2021-11-06 10:32:10,855 INFO L226 Difference]: Without dead ends: 142 [2021-11-06 10:32:10,856 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2021-11-06 10:32:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-06 10:32:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-11-06 10:32:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.0141843971631206) internal successors, (143), 141 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2021-11-06 10:32:10,866 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 139 [2021-11-06 10:32:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:32:10,867 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2021-11-06 10:32:10,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:32:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2021-11-06 10:32:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-06 10:32:10,867 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:32:10,867 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 10:32:10,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-06 10:32:10,867 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:32:10,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:32:10,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1044157975, now seen corresponding path program 1 times [2021-11-06 10:32:10,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:32:10,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606484864] [2021-11-06 10:32:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:32:10,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms Killed by 15