./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_buf_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_cursor_from_buf_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 13ec24500153ff48401c44b6cbf6e64bbffda498093f21927cfcfb52ad2376ab --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:43:33,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:43:33,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:43:34,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:43:34,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:43:34,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:43:34,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:43:34,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:43:34,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:43:34,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:43:34,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:43:34,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:43:34,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:43:34,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:43:34,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:43:34,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:43:34,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:43:34,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:43:34,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:43:34,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:43:34,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:43:34,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:43:34,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:43:34,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:43:34,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:43:34,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:43:34,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:43:34,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:43:34,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:43:34,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:43:34,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:43:34,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:43:34,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:43:34,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:43:34,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:43:34,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:43:34,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:43:34,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:43:34,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:43:34,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:43:34,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:43:34,064 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:43:34,082 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:43:34,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:43:34,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:43:34,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:43:34,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:43:34,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:43:34,089 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:43:34,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:43:34,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:43:34,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:43:34,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:43:34,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:43:34,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:43:34,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:43:34,090 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:43:34,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:43:34,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:43:34,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:43:34,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:43:34,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:43:34,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:43:34,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:43:34,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:43:34,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:43:34,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:43:34,098 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:43:34,098 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:43:34,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:43:34,098 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:43:34,098 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 -> 13ec24500153ff48401c44b6cbf6e64bbffda498093f21927cfcfb52ad2376ab [2021-11-06 10:43:34,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:43:34,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:43:34,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:43:34,341 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:43:34,342 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:43:34,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_buf_harness.i [2021-11-06 10:43:34,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5e37100/18a5788ebf784b7aa053515c866910e6/FLAG3a214c403 [2021-11-06 10:43:35,004 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:43:35,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_buf_harness.i [2021-11-06 10:43:35,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5e37100/18a5788ebf784b7aa053515c866910e6/FLAG3a214c403 [2021-11-06 10:43:35,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e5e37100/18a5788ebf784b7aa053515c866910e6 [2021-11-06 10:43:35,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:43:35,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:43:35,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:43:35,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:43:35,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:43:35,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:35" (1/1) ... [2021-11-06 10:43:35,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d018c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:35, skipping insertion in model container [2021-11-06 10:43:35,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:35" (1/1) ... [2021-11-06 10:43:35,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:43:35,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:43:35,708 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_cursor_from_buf_harness.i[4498,4511] [2021-11-06 10:43:35,717 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_cursor_from_buf_harness.i[4558,4571] [2021-11-06 10:43:35,732 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:43:35,737 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:43:36,229 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,229 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,230 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,230 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,231 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,238 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,239 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,240 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,240 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,456 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:43:36,457 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:43:36,457 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:43:36,458 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:43:36,459 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:43:36,459 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:43:36,460 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:43:36,460 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:43:36,461 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:43:36,461 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:43:36,539 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:43:36,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,587 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:43:36,665 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:43:36,679 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_cursor_from_buf_harness.i[4498,4511] [2021-11-06 10:43:36,680 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_cursor_from_buf_harness.i[4558,4571] [2021-11-06 10:43:36,681 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:43:36,681 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:43:36,699 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,700 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,700 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,700 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,702 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,711 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,711 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,712 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,714 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,749 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:43:36,749 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:43:36,750 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:43:36,750 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:43:36,751 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:43:36,751 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:43:36,752 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:43:36,752 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:43:36,752 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:43:36,752 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:43:36,773 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:43:36,890 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,891 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:43:36,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:43:37,058 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:43:37,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37 WrapperNode [2021-11-06 10:43:37,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:43:37,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:43:37,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:43:37,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:43:37,064 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:43:37" (1/1) ... [2021-11-06 10:43:37,128 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:43:37" (1/1) ... [2021-11-06 10:43:37,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:43:37,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:43:37,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:43:37,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:43:37,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37" (1/1) ... [2021-11-06 10:43:37,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37" (1/1) ... [2021-11-06 10:43:37,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37" (1/1) ... [2021-11-06 10:43:37,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37" (1/1) ... [2021-11-06 10:43:37,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37" (1/1) ... [2021-11-06 10:43:37,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37" (1/1) ... [2021-11-06 10:43:37,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37" (1/1) ... [2021-11-06 10:43:37,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:43:37,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:43:37,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:43:37,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:43:37,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37" (1/1) ... [2021-11-06 10:43:37,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:43:37,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:43:37,378 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:43:37,409 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:43:37,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:43:37,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:43:37,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:43:37,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:43:37,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:43:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:43:37,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:43:37,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:43:37,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:43:37,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:43:37,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:43:44,747 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:43:44,750 INFO L299 CfgBuilder]: Removed 74 assume(true) statements. [2021-11-06 10:43:44,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:44 BoogieIcfgContainer [2021-11-06 10:43:44,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:43:44,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:43:44,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:43:44,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:43:44,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:43:35" (1/3) ... [2021-11-06 10:43:44,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ba43df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:44, skipping insertion in model container [2021-11-06 10:43:44,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:37" (2/3) ... [2021-11-06 10:43:44,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ba43df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:44, skipping insertion in model container [2021-11-06 10:43:44,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:44" (3/3) ... [2021-11-06 10:43:44,759 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_buf_harness.i [2021-11-06 10:43:44,762 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:43:44,762 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-06 10:43:44,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:43:44,802 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:43:44,802 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-06 10:43:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 137 states have (on average 1.4817518248175183) internal successors, (203), 148 states have internal predecessors, (203), 0 states have call successors, (0), 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:43:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 10:43:44,817 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:43:44,817 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] [2021-11-06 10:43:44,818 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:43:44,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:43:44,821 INFO L85 PathProgramCache]: Analyzing trace with hash -324613171, now seen corresponding path program 1 times [2021-11-06 10:43:44,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:43:44,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869761391] [2021-11-06 10:43:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:43:44,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:43:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:43:45,249 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:43:45,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:43:45,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869761391] [2021-11-06 10:43:45,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869761391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:43:45,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:43:45,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 10:43:45,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324149680] [2021-11-06 10:43:45,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 10:43:45,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:43:45,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 10:43:45,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:43:45,270 INFO L87 Difference]: Start difference. First operand has 149 states, 137 states have (on average 1.4817518248175183) internal successors, (203), 148 states have internal predecessors, (203), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:43:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:43:45,290 INFO L93 Difference]: Finished difference Result 294 states and 401 transitions. [2021-11-06 10:43:45,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 10:43:45,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-06 10:43:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:43:45,299 INFO L225 Difference]: With dead ends: 294 [2021-11-06 10:43:45,300 INFO L226 Difference]: Without dead ends: 142 [2021-11-06 10:43:45,303 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:43:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-06 10:43:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-11-06 10:43:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 141 states have internal predecessors, (177), 0 states have call successors, (0), 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:43:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 177 transitions. [2021-11-06 10:43:45,347 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 177 transitions. Word has length 29 [2021-11-06 10:43:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:43:45,347 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 177 transitions. [2021-11-06 10:43:45,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:43:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 177 transitions. [2021-11-06 10:43:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 10:43:45,350 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:43:45,350 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] [2021-11-06 10:43:45,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:43:45,352 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:43:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:43:45,354 INFO L85 PathProgramCache]: Analyzing trace with hash 924018381, now seen corresponding path program 1 times [2021-11-06 10:43:45,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:43:45,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347356312] [2021-11-06 10:43:45,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:43:45,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:43:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:43:45,656 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:43:45,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:43:45,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347356312] [2021-11-06 10:43:45,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347356312] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:43:45,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:43:45,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:43:45,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939043463] [2021-11-06 10:43:45,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:43:45,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:43:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:43:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:43:45,659 INFO L87 Difference]: Start difference. First operand 142 states and 177 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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:43:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:43:45,779 INFO L93 Difference]: Finished difference Result 258 states and 320 transitions. [2021-11-06 10:43:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:43:45,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-06 10:43:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:43:45,781 INFO L225 Difference]: With dead ends: 258 [2021-11-06 10:43:45,781 INFO L226 Difference]: Without dead ends: 142 [2021-11-06 10:43:45,782 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:43:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-06 10:43:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-11-06 10:43:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 141 states have internal predecessors, (174), 0 states have call successors, (0), 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:43:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2021-11-06 10:43:45,787 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 29 [2021-11-06 10:43:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:43:45,787 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2021-11-06 10:43:45,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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:43:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2021-11-06 10:43:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 10:43:45,788 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:43:45,788 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] [2021-11-06 10:43:45,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 10:43:45,789 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:43:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:43:45,789 INFO L85 PathProgramCache]: Analyzing trace with hash -730987477, now seen corresponding path program 1 times [2021-11-06 10:43:45,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:43:45,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597502885] [2021-11-06 10:43:45,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:43:45,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:43:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:43:46,018 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:43:46,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:43:46,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597502885] [2021-11-06 10:43:46,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597502885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:43:46,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:43:46,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:43:46,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721441693] [2021-11-06 10:43:46,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:43:46,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:43:46,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:43:46,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:43:46,020 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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:43:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:43:46,213 INFO L93 Difference]: Finished difference Result 289 states and 358 transitions. [2021-11-06 10:43:46,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:43:46,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-06 10:43:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:43:46,215 INFO L225 Difference]: With dead ends: 289 [2021-11-06 10:43:46,215 INFO L226 Difference]: Without dead ends: 172 [2021-11-06 10:43:46,216 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:43:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-06 10:43:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 148. [2021-11-06 10:43:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 137 states have (on average 1.313868613138686) internal successors, (180), 147 states have internal predecessors, (180), 0 states have call successors, (0), 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:43:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 180 transitions. [2021-11-06 10:43:46,222 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 180 transitions. Word has length 41 [2021-11-06 10:43:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:43:46,222 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 180 transitions. [2021-11-06 10:43:46,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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:43:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 180 transitions. [2021-11-06 10:43:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 10:43:46,223 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:43:46,226 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] [2021-11-06 10:43:46,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:43:46,226 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:43:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:43:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash -793027091, now seen corresponding path program 1 times [2021-11-06 10:43:46,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:43:46,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785159436] [2021-11-06 10:43:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:43:46,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:43:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:43:46,413 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:43:46,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:43:46,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785159436] [2021-11-06 10:43:46,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785159436] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:43:46,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:43:46,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 10:43:46,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267569182] [2021-11-06 10:43:46,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 10:43:46,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:43:46,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 10:43:46,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:43:46,415 INFO L87 Difference]: Start difference. First operand 148 states and 180 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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:43:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:43:46,442 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2021-11-06 10:43:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 10:43:46,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-06 10:43:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:43:46,444 INFO L225 Difference]: With dead ends: 231 [2021-11-06 10:43:46,444 INFO L226 Difference]: Without dead ends: 148 [2021-11-06 10:43:46,445 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:43:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-06 10:43:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-11-06 10:43:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 147 states have internal predecessors, (179), 0 states have call successors, (0), 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:43:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 179 transitions. [2021-11-06 10:43:46,451 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 179 transitions. Word has length 41 [2021-11-06 10:43:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:43:46,452 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 179 transitions. [2021-11-06 10:43:46,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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:43:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 179 transitions. [2021-11-06 10:43:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 10:43:46,453 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:43:46,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] [2021-11-06 10:43:46,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:43:46,454 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:43:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:43:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 713904840, now seen corresponding path program 1 times [2021-11-06 10:43:46,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:43:46,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570120903] [2021-11-06 10:43:46,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:43:46,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:43:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:43:46,960 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:43:46,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:43:46,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570120903] [2021-11-06 10:43:46,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570120903] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:43:46,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:43:46,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:43:46,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064076185] [2021-11-06 10:43:46,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:43:46,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:43:46,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:43:46,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:43:46,962 INFO L87 Difference]: Start difference. First operand 148 states and 179 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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:43:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:43:47,382 INFO L93 Difference]: Finished difference Result 225 states and 264 transitions. [2021-11-06 10:43:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:43:47,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-06 10:43:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:43:47,384 INFO L225 Difference]: With dead ends: 225 [2021-11-06 10:43:47,384 INFO L226 Difference]: Without dead ends: 221 [2021-11-06 10:43:47,384 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:43:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-06 10:43:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 156. [2021-11-06 10:43:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 145 states have (on average 1.289655172413793) internal successors, (187), 155 states have internal predecessors, (187), 0 states have call successors, (0), 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:43:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 187 transitions. [2021-11-06 10:43:47,391 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 187 transitions. Word has length 43 [2021-11-06 10:43:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:43:47,392 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 187 transitions. [2021-11-06 10:43:47,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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:43:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 187 transitions. [2021-11-06 10:43:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 10:43:47,393 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:43:47,393 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] [2021-11-06 10:43:47,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:43:47,394 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:43:47,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:43:47,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1136209088, now seen corresponding path program 1 times [2021-11-06 10:43:47,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:43:47,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321569311] [2021-11-06 10:43:47,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:43:47,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:43:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:43:48,445 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:43:48,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:43:48,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321569311] [2021-11-06 10:43:48,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321569311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:43:48,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:43:48,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:43:48,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706544829] [2021-11-06 10:43:48,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:43:48,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:43:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:43:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:43:48,447 INFO L87 Difference]: Start difference. First operand 156 states and 187 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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:43:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:43:56,397 INFO L93 Difference]: Finished difference Result 299 states and 359 transitions. [2021-11-06 10:43:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:43:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-11-06 10:43:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:43:56,399 INFO L225 Difference]: With dead ends: 299 [2021-11-06 10:43:56,399 INFO L226 Difference]: Without dead ends: 205 [2021-11-06 10:43:56,400 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:43:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-11-06 10:43:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 178. [2021-11-06 10:43:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 177 states have internal predecessors, (215), 0 states have call successors, (0), 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:43:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 215 transitions. [2021-11-06 10:43:56,407 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 215 transitions. Word has length 47 [2021-11-06 10:43:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:43:56,407 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 215 transitions. [2021-11-06 10:43:56,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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:43:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 215 transitions. [2021-11-06 10:43:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 10:43:56,409 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:43:56,409 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:43:56,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:43:56,409 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:43:56,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:43:56,410 INFO L85 PathProgramCache]: Analyzing trace with hash 343490267, now seen corresponding path program 1 times [2021-11-06 10:43:56,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:43:56,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463831739] [2021-11-06 10:43:56,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:43:56,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:43:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:43:57,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:43:57,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:43:57,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463831739] [2021-11-06 10:43:57,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463831739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:43:57,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:43:57,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:43:57,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506143143] [2021-11-06 10:43:57,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:43:57,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:43:57,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:43:57,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:43:57,517 INFO L87 Difference]: Start difference. First operand 178 states and 215 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:44:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:13,662 INFO L93 Difference]: Finished difference Result 493 states and 600 transitions. [2021-11-06 10:44:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-06 10:44:13,665 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:44:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:13,666 INFO L225 Difference]: With dead ends: 493 [2021-11-06 10:44:13,666 INFO L226 Difference]: Without dead ends: 399 [2021-11-06 10:44:13,667 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2021-11-06 10:44:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-11-06 10:44:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 176. [2021-11-06 10:44:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 165 states have (on average 1.284848484848485) internal successors, (212), 175 states have internal predecessors, (212), 0 states have call successors, (0), 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:44:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2021-11-06 10:44:13,675 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 50 [2021-11-06 10:44:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:13,675 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2021-11-06 10:44:13,675 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:44:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2021-11-06 10:44:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 10:44:13,678 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:44:13,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:44:13,679 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:44:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash 367795429, now seen corresponding path program 1 times [2021-11-06 10:44:13,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:13,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81564490] [2021-11-06 10:44:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:13,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:14,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:44:14,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:14,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81564490] [2021-11-06 10:44:14,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81564490] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:14,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:14,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:44:14,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823832073] [2021-11-06 10:44:14,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:44:14,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:44:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:44:14,379 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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:44:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:14,881 INFO L93 Difference]: Finished difference Result 403 states and 475 transitions. [2021-11-06 10:44:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:44:14,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-11-06 10:44:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:14,883 INFO L225 Difference]: With dead ends: 403 [2021-11-06 10:44:14,883 INFO L226 Difference]: Without dead ends: 243 [2021-11-06 10:44:14,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:44:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-06 10:44:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 176. [2021-11-06 10:44:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 165 states have (on average 1.2666666666666666) internal successors, (209), 175 states have internal predecessors, (209), 0 states have call successors, (0), 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:44:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 209 transitions. [2021-11-06 10:44:14,887 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 209 transitions. Word has length 54 [2021-11-06 10:44:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:14,888 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 209 transitions. [2021-11-06 10:44:14,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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:44:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 209 transitions. [2021-11-06 10:44:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 10:44:14,888 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:14,888 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] [2021-11-06 10:44:14,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:44:14,889 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:44:14,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1067867056, now seen corresponding path program 1 times [2021-11-06 10:44:14,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:14,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650930149] [2021-11-06 10:44:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:14,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:15,275 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:44:15,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:15,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650930149] [2021-11-06 10:44:15,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650930149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:15,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:15,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:44:15,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442452431] [2021-11-06 10:44:15,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:44:15,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:44:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:44:15,277 INFO L87 Difference]: Start difference. First operand 176 states and 209 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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:44:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:15,645 INFO L93 Difference]: Finished difference Result 266 states and 307 transitions. [2021-11-06 10:44:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:44:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-11-06 10:44:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:15,647 INFO L225 Difference]: With dead ends: 266 [2021-11-06 10:44:15,647 INFO L226 Difference]: Without dead ends: 264 [2021-11-06 10:44:15,647 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:44:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-06 10:44:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 180. [2021-11-06 10:44:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 169 states have (on average 1.2603550295857988) internal successors, (213), 179 states have internal predecessors, (213), 0 states have call successors, (0), 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:44:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 213 transitions. [2021-11-06 10:44:15,652 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 213 transitions. Word has length 55 [2021-11-06 10:44:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:15,652 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 213 transitions. [2021-11-06 10:44:15,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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:44:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 213 transitions. [2021-11-06 10:44:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 10:44:15,653 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:15,653 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:44:15,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:44:15,653 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:44:15,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:15,653 INFO L85 PathProgramCache]: Analyzing trace with hash -574661108, now seen corresponding path program 1 times [2021-11-06 10:44:15,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:15,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690478944] [2021-11-06 10:44:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:15,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:16,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:44:16,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:16,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690478944] [2021-11-06 10:44:16,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690478944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:16,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:16,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:44:16,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200333695] [2021-11-06 10:44:16,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:44:16,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:44:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:44:16,323 INFO L87 Difference]: Start difference. First operand 180 states and 213 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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:44:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:19,662 INFO L93 Difference]: Finished difference Result 599 states and 699 transitions. [2021-11-06 10:44:19,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:44:19,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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:44:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:19,664 INFO L225 Difference]: With dead ends: 599 [2021-11-06 10:44:19,664 INFO L226 Difference]: Without dead ends: 459 [2021-11-06 10:44:19,664 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:44:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-11-06 10:44:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 192. [2021-11-06 10:44:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 181 states have (on average 1.2541436464088398) internal successors, (227), 191 states have internal predecessors, (227), 0 states have call successors, (0), 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:44:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 227 transitions. [2021-11-06 10:44:19,670 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 227 transitions. Word has length 56 [2021-11-06 10:44:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:19,670 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 227 transitions. [2021-11-06 10:44:19,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 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:44:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 227 transitions. [2021-11-06 10:44:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 10:44:19,671 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:19,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] [2021-11-06 10:44:19,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:44:19,672 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:44:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1124541866, now seen corresponding path program 1 times [2021-11-06 10:44:19,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:19,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036090046] [2021-11-06 10:44:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:19,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:22,377 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:44:22,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:22,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036090046] [2021-11-06 10:44:22,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036090046] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:22,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:22,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:44:22,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438635192] [2021-11-06 10:44:22,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:44:22,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:22,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:44:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:44:22,379 INFO L87 Difference]: Start difference. First operand 192 states and 227 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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:44:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:27,730 INFO L93 Difference]: Finished difference Result 331 states and 390 transitions. [2021-11-06 10:44:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:44:27,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-11-06 10:44:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:27,731 INFO L225 Difference]: With dead ends: 331 [2021-11-06 10:44:27,731 INFO L226 Difference]: Without dead ends: 213 [2021-11-06 10:44:27,732 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:44:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-06 10:44:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 192. [2021-11-06 10:44:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 181 states have (on average 1.2486187845303867) internal successors, (226), 191 states have internal predecessors, (226), 0 states have call successors, (0), 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:44:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 226 transitions. [2021-11-06 10:44:27,737 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 226 transitions. Word has length 59 [2021-11-06 10:44:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:27,737 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 226 transitions. [2021-11-06 10:44:27,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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:44:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 226 transitions. [2021-11-06 10:44:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 10:44:27,738 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:27,738 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:44:27,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:44:27,738 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:44:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash 700643131, now seen corresponding path program 1 times [2021-11-06 10:44:27,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:27,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035394424] [2021-11-06 10:44:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:27,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:28,221 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:44:28,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:28,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035394424] [2021-11-06 10:44:28,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035394424] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:28,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:28,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:44:28,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546062374] [2021-11-06 10:44:28,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:44:28,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:28,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:44:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:44:28,222 INFO L87 Difference]: Start difference. First operand 192 states and 226 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:44:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:33,126 INFO L93 Difference]: Finished difference Result 544 states and 638 transitions. [2021-11-06 10:44:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:44:33,127 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:44:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:33,128 INFO L225 Difference]: With dead ends: 544 [2021-11-06 10:44:33,128 INFO L226 Difference]: Without dead ends: 375 [2021-11-06 10:44:33,128 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:44:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-06 10:44:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 219. [2021-11-06 10:44:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 208 states have (on average 1.2451923076923077) internal successors, (259), 218 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:44:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2021-11-06 10:44:33,135 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 62 [2021-11-06 10:44:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:33,135 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2021-11-06 10:44:33,135 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:44:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2021-11-06 10:44:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 10:44:33,136 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:33,136 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:44:33,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:44:33,137 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:44:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1129889993, now seen corresponding path program 1 times [2021-11-06 10:44:33,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:33,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81489904] [2021-11-06 10:44:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:33,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:33,285 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:44:33,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:33,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81489904] [2021-11-06 10:44:33,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81489904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:33,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:33,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:44:33,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967494271] [2021-11-06 10:44:33,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:44:33,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:44:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:44:33,287 INFO L87 Difference]: Start difference. First operand 219 states and 259 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:44:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:33,444 INFO L93 Difference]: Finished difference Result 419 states and 494 transitions. [2021-11-06 10:44:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:44:33,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:44:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:33,445 INFO L225 Difference]: With dead ends: 419 [2021-11-06 10:44:33,445 INFO L226 Difference]: Without dead ends: 211 [2021-11-06 10:44:33,446 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:44:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-11-06 10:44:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2021-11-06 10:44:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 194 states have (on average 1.211340206185567) internal successors, (235), 204 states have internal predecessors, (235), 0 states have call successors, (0), 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:44:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2021-11-06 10:44:33,450 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 62 [2021-11-06 10:44:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:33,451 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2021-11-06 10:44:33,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:44:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2021-11-06 10:44:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 10:44:33,452 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:33,452 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:44:33,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:44:33,452 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:44:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1686614849, now seen corresponding path program 1 times [2021-11-06 10:44:33,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:33,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534391687] [2021-11-06 10:44:33,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:33,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:35,077 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:44:35,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:35,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534391687] [2021-11-06 10:44:35,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534391687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:35,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:35,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:44:35,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431698612] [2021-11-06 10:44:35,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:44:35,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:35,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:44:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:44:35,079 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 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:44:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:44:50,059 INFO L93 Difference]: Finished difference Result 469 states and 538 transitions. [2021-11-06 10:44:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:44:50,060 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 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:44:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:44:50,061 INFO L225 Difference]: With dead ends: 469 [2021-11-06 10:44:50,061 INFO L226 Difference]: Without dead ends: 316 [2021-11-06 10:44:50,061 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2021-11-06 10:44:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-11-06 10:44:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 205. [2021-11-06 10:44:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 194 states have (on average 1.211340206185567) internal successors, (235), 204 states have internal predecessors, (235), 0 states have call successors, (0), 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:44:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2021-11-06 10:44:50,066 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 62 [2021-11-06 10:44:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:44:50,066 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2021-11-06 10:44:50,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 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:44:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2021-11-06 10:44:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 10:44:50,067 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:44:50,067 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:44:50,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 10:44:50,067 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:44:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:44:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1262968127, now seen corresponding path program 1 times [2021-11-06 10:44:50,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:44:50,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653328697] [2021-11-06 10:44:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:44:50,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:44:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:44:53,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:44:53,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:44:53,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653328697] [2021-11-06 10:44:53,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653328697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:44:53,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:44:53,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:44:53,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653813223] [2021-11-06 10:44:53,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:44:53,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:44:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:44:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:44:53,670 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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:45:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:10,238 INFO L93 Difference]: Finished difference Result 459 states and 525 transitions. [2021-11-06 10:45:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-06 10:45:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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:45:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:10,240 INFO L225 Difference]: With dead ends: 459 [2021-11-06 10:45:10,240 INFO L226 Difference]: Without dead ends: 357 [2021-11-06 10:45:10,241 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2021-11-06 10:45:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-06 10:45:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 217. [2021-11-06 10:45:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 206 states have (on average 1.2087378640776698) internal successors, (249), 216 states have internal predecessors, (249), 0 states have call successors, (0), 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:45:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 249 transitions. [2021-11-06 10:45:10,246 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 249 transitions. Word has length 62 [2021-11-06 10:45:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:10,246 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 249 transitions. [2021-11-06 10:45:10,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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:45:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 249 transitions. [2021-11-06 10:45:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 10:45:10,247 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:10,249 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:45:10,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 10:45:10,250 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:45:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -582909757, now seen corresponding path program 1 times [2021-11-06 10:45:10,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:10,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299674628] [2021-11-06 10:45:10,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:10,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:10,717 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:45:10,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:10,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299674628] [2021-11-06 10:45:10,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299674628] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:10,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:10,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:45:10,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758451635] [2021-11-06 10:45:10,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:45:10,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:10,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:45:10,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:45:10,719 INFO L87 Difference]: Start difference. First operand 217 states and 249 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:45:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:13,307 INFO L93 Difference]: Finished difference Result 323 states and 372 transitions. [2021-11-06 10:45:13,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:45:13,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:45:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:13,308 INFO L225 Difference]: With dead ends: 323 [2021-11-06 10:45:13,308 INFO L226 Difference]: Without dead ends: 217 [2021-11-06 10:45:13,308 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:45:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-06 10:45:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-11-06 10:45:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 206 states have (on average 1.1941747572815533) internal successors, (246), 216 states have internal predecessors, (246), 0 states have call successors, (0), 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:45:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 246 transitions. [2021-11-06 10:45:13,314 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 246 transitions. Word has length 62 [2021-11-06 10:45:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:13,314 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 246 transitions. [2021-11-06 10:45:13,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:45:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 246 transitions. [2021-11-06 10:45:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 10:45:13,315 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:13,315 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:45:13,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 10:45:13,315 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:45:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash 425975615, now seen corresponding path program 1 times [2021-11-06 10:45:13,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:13,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326581854] [2021-11-06 10:45:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:13,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:14,413 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:45:14,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:14,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326581854] [2021-11-06 10:45:14,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326581854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:14,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:14,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:45:14,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525762581] [2021-11-06 10:45:14,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:45:14,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:14,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:45:14,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:45:14,415 INFO L87 Difference]: Start difference. First operand 217 states and 246 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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:45:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:30,809 INFO L93 Difference]: Finished difference Result 446 states and 505 transitions. [2021-11-06 10:45:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:45:30,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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:45:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:30,811 INFO L225 Difference]: With dead ends: 446 [2021-11-06 10:45:30,811 INFO L226 Difference]: Without dead ends: 317 [2021-11-06 10:45:30,811 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:45:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-06 10:45:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 236. [2021-11-06 10:45:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 225 states have (on average 1.1866666666666668) internal successors, (267), 235 states have internal predecessors, (267), 0 states have call successors, (0), 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:45:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 267 transitions. [2021-11-06 10:45:30,818 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 267 transitions. Word has length 62 [2021-11-06 10:45:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:30,818 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 267 transitions. [2021-11-06 10:45:30,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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:45:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 267 transitions. [2021-11-06 10:45:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 10:45:30,819 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:30,819 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:45:30,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 10:45:30,819 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:45:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1414502148, now seen corresponding path program 1 times [2021-11-06 10:45:30,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:30,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798186212] [2021-11-06 10:45:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:30,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:31,317 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:45:31,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:31,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798186212] [2021-11-06 10:45:31,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798186212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:31,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:31,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:45:31,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473296229] [2021-11-06 10:45:31,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:45:31,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:45:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:45:31,318 INFO L87 Difference]: Start difference. First operand 236 states and 267 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:45:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:32,022 INFO L93 Difference]: Finished difference Result 330 states and 370 transitions. [2021-11-06 10:45:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:45:32,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:45:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:32,025 INFO L225 Difference]: With dead ends: 330 [2021-11-06 10:45:32,025 INFO L226 Difference]: Without dead ends: 326 [2021-11-06 10:45:32,025 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:45:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-11-06 10:45:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 240. [2021-11-06 10:45:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 229 states have (on average 1.1834061135371179) internal successors, (271), 239 states have internal predecessors, (271), 0 states have call successors, (0), 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:45:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2021-11-06 10:45:32,033 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 64 [2021-11-06 10:45:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:32,033 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2021-11-06 10:45:32,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:45:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2021-11-06 10:45:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 10:45:32,034 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:32,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] [2021-11-06 10:45:32,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 10:45:32,035 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:45:32,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2071118522, now seen corresponding path program 1 times [2021-11-06 10:45:32,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:32,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430049197] [2021-11-06 10:45:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:32,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:32,663 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:45:32,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:32,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430049197] [2021-11-06 10:45:32,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430049197] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:32,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:32,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:45:32,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38218759] [2021-11-06 10:45:32,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:45:32,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:32,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:45:32,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:45:32,665 INFO L87 Difference]: Start difference. First operand 240 states and 271 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:45:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:36,427 INFO L93 Difference]: Finished difference Result 376 states and 418 transitions. [2021-11-06 10:45:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:45:36,427 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:45:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:36,428 INFO L225 Difference]: With dead ends: 376 [2021-11-06 10:45:36,429 INFO L226 Difference]: Without dead ends: 372 [2021-11-06 10:45:36,429 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:45:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-06 10:45:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 231. [2021-11-06 10:45:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 221 states have (on average 1.1855203619909502) internal successors, (262), 230 states have internal predecessors, (262), 0 states have call successors, (0), 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:45:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 262 transitions. [2021-11-06 10:45:36,435 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 262 transitions. Word has length 64 [2021-11-06 10:45:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:36,436 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 262 transitions. [2021-11-06 10:45:36,436 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:45:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 262 transitions. [2021-11-06 10:45:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-06 10:45:36,436 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:36,436 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:45:36,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 10:45:36,436 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:45:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1739279944, now seen corresponding path program 1 times [2021-11-06 10:45:36,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:36,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669559160] [2021-11-06 10:45:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:36,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:38,215 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:45:38,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:38,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669559160] [2021-11-06 10:45:38,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669559160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:38,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:38,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 10:45:38,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536061598] [2021-11-06 10:45:38,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 10:45:38,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:38,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 10:45:38,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:45:38,217 INFO L87 Difference]: Start difference. First operand 231 states and 262 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 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:45:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:53,827 INFO L93 Difference]: Finished difference Result 391 states and 443 transitions. [2021-11-06 10:45:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:45:53,828 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 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:45:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:53,829 INFO L225 Difference]: With dead ends: 391 [2021-11-06 10:45:53,829 INFO L226 Difference]: Without dead ends: 226 [2021-11-06 10:45:53,830 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:45:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-06 10:45:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2021-11-06 10:45:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.1732673267326732) internal successors, (237), 211 states have internal predecessors, (237), 0 states have call successors, (0), 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:45:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2021-11-06 10:45:53,836 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 68 [2021-11-06 10:45:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:53,836 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2021-11-06 10:45:53,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 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:45:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2021-11-06 10:45:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:45:53,837 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:53,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] [2021-11-06 10:45:53,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 10:45:53,837 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:45:53,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:53,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1068745994, now seen corresponding path program 1 times [2021-11-06 10:45:53,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:53,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498396157] [2021-11-06 10:45:53,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:53,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:54,012 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:45:54,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:54,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498396157] [2021-11-06 10:45:54,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498396157] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:54,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:54,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:45:54,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143271230] [2021-11-06 10:45:54,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:45:54,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:54,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:45:54,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:45:54,014 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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:45:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:45:54,153 INFO L93 Difference]: Finished difference Result 353 states and 395 transitions. [2021-11-06 10:45:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:45:54,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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:45:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:45:54,154 INFO L225 Difference]: With dead ends: 353 [2021-11-06 10:45:54,154 INFO L226 Difference]: Without dead ends: 213 [2021-11-06 10:45:54,155 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:45:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-06 10:45:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 202. [2021-11-06 10:45:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 192 states have (on average 1.1510416666666667) internal successors, (221), 201 states have internal predecessors, (221), 0 states have call successors, (0), 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:45:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 221 transitions. [2021-11-06 10:45:54,160 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 221 transitions. Word has length 71 [2021-11-06 10:45:54,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:45:54,160 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 221 transitions. [2021-11-06 10:45:54,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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:45:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 221 transitions. [2021-11-06 10:45:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:45:54,161 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:45:54,161 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:45:54,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 10:45:54,161 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:45:54,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:45:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1728277516, now seen corresponding path program 1 times [2021-11-06 10:45:54,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:45:54,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033432284] [2021-11-06 10:45:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:45:54,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:45:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:45:55,282 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:45:55,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:45:55,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033432284] [2021-11-06 10:45:55,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033432284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:45:55,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:45:55,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:45:55,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934658525] [2021-11-06 10:45:55,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:45:55,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:45:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:45:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:45:55,283 INFO L87 Difference]: Start difference. First operand 202 states and 221 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:46:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:05,547 INFO L93 Difference]: Finished difference Result 319 states and 350 transitions. [2021-11-06 10:46:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:46:05,550 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:46:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:05,550 INFO L225 Difference]: With dead ends: 319 [2021-11-06 10:46:05,550 INFO L226 Difference]: Without dead ends: 212 [2021-11-06 10:46:05,551 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:46:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-06 10:46:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 202. [2021-11-06 10:46:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 192 states have (on average 1.1458333333333333) internal successors, (220), 201 states have internal predecessors, (220), 0 states have call successors, (0), 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:46:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2021-11-06 10:46:05,560 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 71 [2021-11-06 10:46:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:05,560 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2021-11-06 10:46:05,560 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:46:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2021-11-06 10:46:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:46:05,561 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:05,561 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:46:05,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 10:46:05,562 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:46:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:05,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1026677642, now seen corresponding path program 1 times [2021-11-06 10:46:05,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:05,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911933209] [2021-11-06 10:46:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:05,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:08,994 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:46:08,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:08,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911933209] [2021-11-06 10:46:08,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911933209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:46:08,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:46:08,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:46:08,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185188908] [2021-11-06 10:46:08,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:46:08,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:46:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:46:08,996 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) 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:46:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:27,701 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2021-11-06 10:46:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:46:27,701 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) 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:46:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:27,702 INFO L225 Difference]: With dead ends: 272 [2021-11-06 10:46:27,702 INFO L226 Difference]: Without dead ends: 191 [2021-11-06 10:46:27,703 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:46:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-06 10:46:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-11-06 10:46:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 181 states have (on average 1.132596685082873) internal successors, (205), 190 states have internal predecessors, (205), 0 states have call successors, (0), 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:46:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2021-11-06 10:46:27,708 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 71 [2021-11-06 10:46:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:27,708 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2021-11-06 10:46:27,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) 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:46:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2021-11-06 10:46:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:46:27,709 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:27,709 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:46:27,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 10:46:27,709 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:46:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash 273725830, now seen corresponding path program 1 times [2021-11-06 10:46:27,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:27,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870598366] [2021-11-06 10:46:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:27,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:28,063 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:46:28,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:28,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870598366] [2021-11-06 10:46:28,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870598366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:46:28,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:46:28,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:46:28,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134522352] [2021-11-06 10:46:28,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:46:28,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:28,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:46:28,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:46:28,065 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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:46:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:32,711 INFO L93 Difference]: Finished difference Result 259 states and 279 transitions. [2021-11-06 10:46:32,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:46:32,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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:46:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:32,712 INFO L225 Difference]: With dead ends: 259 [2021-11-06 10:46:32,712 INFO L226 Difference]: Without dead ends: 189 [2021-11-06 10:46:32,712 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:46:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-06 10:46:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-11-06 10:46:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 179 states have (on average 1.1229050279329609) internal successors, (201), 188 states have internal predecessors, (201), 0 states have call successors, (0), 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:46:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2021-11-06 10:46:32,717 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 71 [2021-11-06 10:46:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:32,718 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2021-11-06 10:46:32,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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:46:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2021-11-06 10:46:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:46:32,718 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:32,718 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:46:32,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 10:46:32,718 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:46:32,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:32,719 INFO L85 PathProgramCache]: Analyzing trace with hash -406332540, now seen corresponding path program 1 times [2021-11-06 10:46:32,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:32,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133804614] [2021-11-06 10:46:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:32,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:33,520 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:46:33,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:33,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133804614] [2021-11-06 10:46:33,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133804614] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:46:33,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:46:33,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:46:33,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392180128] [2021-11-06 10:46:33,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:46:33,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:46:33,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:46:33,521 INFO L87 Difference]: Start difference. First operand 189 states and 201 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:46:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:43,531 INFO L93 Difference]: Finished difference Result 326 states and 350 transitions. [2021-11-06 10:46:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:46:43,532 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:46:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:43,533 INFO L225 Difference]: With dead ends: 326 [2021-11-06 10:46:43,533 INFO L226 Difference]: Without dead ends: 258 [2021-11-06 10:46:43,534 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:46:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-06 10:46:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 189. [2021-11-06 10:46:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 179 states have (on average 1.1173184357541899) internal successors, (200), 188 states have internal predecessors, (200), 0 states have call successors, (0), 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:46:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2021-11-06 10:46:43,546 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 71 [2021-11-06 10:46:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:43,546 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2021-11-06 10:46:43,547 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:46:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2021-11-06 10:46:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 10:46:43,548 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:43,548 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:46:43,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 10:46:43,548 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:46:43,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1473545407, now seen corresponding path program 1 times [2021-11-06 10:46:43,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:43,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047050000] [2021-11-06 10:46:43,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:43,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:43,953 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:46:43,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:43,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047050000] [2021-11-06 10:46:43,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047050000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:46:43,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:46:43,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:46:43,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759721485] [2021-11-06 10:46:43,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:46:43,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:43,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:46:43,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:46:43,956 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 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:46:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:44,496 INFO L93 Difference]: Finished difference Result 258 states and 275 transitions. [2021-11-06 10:46:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:46:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 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:46:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:44,512 INFO L225 Difference]: With dead ends: 258 [2021-11-06 10:46:44,512 INFO L226 Difference]: Without dead ends: 256 [2021-11-06 10:46:44,512 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:46:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-06 10:46:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 195. [2021-11-06 10:46:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.1135135135135135) internal successors, (206), 194 states have internal predecessors, (206), 0 states have call successors, (0), 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:46:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 206 transitions. [2021-11-06 10:46:44,527 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 206 transitions. Word has length 73 [2021-11-06 10:46:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:44,527 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 206 transitions. [2021-11-06 10:46:44,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 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:46:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 206 transitions. [2021-11-06 10:46:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 10:46:44,528 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:44,528 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:46:44,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 10:46:44,528 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:46:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash 664198781, now seen corresponding path program 1 times [2021-11-06 10:46:44,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:44,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834703245] [2021-11-06 10:46:44,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:44,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:45,511 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:46:45,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:45,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834703245] [2021-11-06 10:46:45,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834703245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:46:45,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:46:45,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:46:45,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698133586] [2021-11-06 10:46:45,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:46:45,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:46:45,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:46:45,512 INFO L87 Difference]: Start difference. First operand 195 states and 206 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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:46:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:53,585 INFO L93 Difference]: Finished difference Result 328 states and 351 transitions. [2021-11-06 10:46:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:46:53,585 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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:46:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:53,586 INFO L225 Difference]: With dead ends: 328 [2021-11-06 10:46:53,587 INFO L226 Difference]: Without dead ends: 259 [2021-11-06 10:46:53,587 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-11-06 10:46:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-06 10:46:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 195. [2021-11-06 10:46:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.1081081081081081) internal successors, (205), 194 states have internal predecessors, (205), 0 states have call successors, (0), 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:46:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 205 transitions. [2021-11-06 10:46:53,612 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 205 transitions. Word has length 73 [2021-11-06 10:46:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:53,613 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 205 transitions. [2021-11-06 10:46:53,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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:46:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 205 transitions. [2021-11-06 10:46:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 10:46:53,613 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:53,614 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] [2021-11-06 10:46:53,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 10:46:53,614 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:46:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -539652075, now seen corresponding path program 1 times [2021-11-06 10:46:53,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:53,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306428947] [2021-11-06 10:46:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:53,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:53,793 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:46:53,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:53,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306428947] [2021-11-06 10:46:53,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306428947] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:46:53,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:46:53,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:46:53,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041664656] [2021-11-06 10:46:53,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:46:53,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:46:53,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:46:53,796 INFO L87 Difference]: Start difference. First operand 195 states and 205 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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:46:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:53,875 INFO L93 Difference]: Finished difference Result 241 states and 253 transitions. [2021-11-06 10:46:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:46:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-11-06 10:46:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:53,877 INFO L225 Difference]: With dead ends: 241 [2021-11-06 10:46:53,877 INFO L226 Difference]: Without dead ends: 195 [2021-11-06 10:46:53,877 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:46:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-06 10:46:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-11-06 10:46:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.1027027027027028) internal successors, (204), 194 states have internal predecessors, (204), 0 states have call successors, (0), 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:46:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 204 transitions. [2021-11-06 10:46:53,883 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 204 transitions. Word has length 78 [2021-11-06 10:46:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:53,883 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 204 transitions. [2021-11-06 10:46:53,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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:46:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 204 transitions. [2021-11-06 10:46:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 10:46:53,884 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:53,884 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] [2021-11-06 10:46:53,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 10:46:53,885 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:46:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1001040936, now seen corresponding path program 1 times [2021-11-06 10:46:53,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:53,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455380492] [2021-11-06 10:46:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:53,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:46:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:46:54,448 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:46:54,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:46:54,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455380492] [2021-11-06 10:46:54,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455380492] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:46:54,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:46:54,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:46:54,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644613619] [2021-11-06 10:46:54,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:46:54,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:46:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:46:54,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:46:54,450 INFO L87 Difference]: Start difference. First operand 195 states and 204 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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:46:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:46:59,380 INFO L93 Difference]: Finished difference Result 328 states and 345 transitions. [2021-11-06 10:46:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:46:59,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-11-06 10:46:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:46:59,381 INFO L225 Difference]: With dead ends: 328 [2021-11-06 10:46:59,381 INFO L226 Difference]: Without dead ends: 241 [2021-11-06 10:46:59,381 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:46:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-06 10:46:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 195. [2021-11-06 10:46:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.0918918918918918) internal successors, (202), 194 states have internal predecessors, (202), 0 states have call successors, (0), 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:46:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 202 transitions. [2021-11-06 10:46:59,389 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 202 transitions. Word has length 80 [2021-11-06 10:46:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:46:59,389 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 202 transitions. [2021-11-06 10:46:59,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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:46:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 202 transitions. [2021-11-06 10:46:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 10:46:59,390 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:46:59,390 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] [2021-11-06 10:46:59,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 10:46:59,390 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:46:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:46:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1135054442, now seen corresponding path program 1 times [2021-11-06 10:46:59,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:46:59,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104185018] [2021-11-06 10:46:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:46:59,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:47:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:47:08,898 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:47:08,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:47:08,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104185018] [2021-11-06 10:47:08,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104185018] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:47:08,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:47:08,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:47:08,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108495424] [2021-11-06 10:47:08,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:47:08,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:47:08,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:47:08,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:47:08,899 INFO L87 Difference]: Start difference. First operand 195 states and 202 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 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:47:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:47:26,595 INFO L93 Difference]: Finished difference Result 263 states and 274 transitions. [2021-11-06 10:47:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:47:26,596 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-11-06 10:47:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:47:26,596 INFO L225 Difference]: With dead ends: 263 [2021-11-06 10:47:26,596 INFO L226 Difference]: Without dead ends: 195 [2021-11-06 10:47:26,597 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=276, Invalid=780, Unknown=0, NotChecked=0, Total=1056 [2021-11-06 10:47:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-06 10:47:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-11-06 10:47:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 185 states have (on average 1.0864864864864865) internal successors, (201), 194 states have internal predecessors, (201), 0 states have call successors, (0), 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:47:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 201 transitions. [2021-11-06 10:47:26,604 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 201 transitions. Word has length 80 [2021-11-06 10:47:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:47:26,604 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 201 transitions. [2021-11-06 10:47:26,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 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:47:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 201 transitions. [2021-11-06 10:47:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-06 10:47:26,605 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:47:26,605 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] [2021-11-06 10:47:26,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 10:47:26,606 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:47:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:47:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash 442120207, now seen corresponding path program 1 times [2021-11-06 10:47:26,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:47:26,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932344253] [2021-11-06 10:47:26,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:47:26,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:47:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:47:30,250 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:47:30,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:47:30,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932344253] [2021-11-06 10:47:30,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932344253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:47:30,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:47:30,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-06 10:47:30,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291418753] [2021-11-06 10:47:30,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-06 10:47:30,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:47:30,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-06 10:47:30,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:47:30,251 INFO L87 Difference]: Start difference. First operand 195 states and 201 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 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:47:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:47:49,102 INFO L93 Difference]: Finished difference Result 256 states and 266 transitions. [2021-11-06 10:47:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-06 10:47:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-11-06 10:47:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:47:49,104 INFO L225 Difference]: With dead ends: 256 [2021-11-06 10:47:49,104 INFO L226 Difference]: Without dead ends: 254 [2021-11-06 10:47:49,104 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=382, Invalid=1510, Unknown=0, NotChecked=0, Total=1892 [2021-11-06 10:47:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-11-06 10:47:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 187. [2021-11-06 10:47:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 178 states have (on average 1.0842696629213484) internal successors, (193), 186 states have internal predecessors, (193), 0 states have call successors, (0), 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:47:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 193 transitions. [2021-11-06 10:47:49,111 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 193 transitions. Word has length 82 [2021-11-06 10:47:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:47:49,111 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 193 transitions. [2021-11-06 10:47:49,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 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:47:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 193 transitions. [2021-11-06 10:47:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-06 10:47:49,112 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:47:49,112 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] [2021-11-06 10:47:49,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 10:47:49,112 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:47:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:47:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1039282540, now seen corresponding path program 1 times [2021-11-06 10:47:49,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:47:49,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563409163] [2021-11-06 10:47:49,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:47:49,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:47:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:47:49,518 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:47:49,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:47:49,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563409163] [2021-11-06 10:47:49,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563409163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:47:49,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:47:49,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:47:49,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199670676] [2021-11-06 10:47:49,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:47:49,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:47:49,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:47:49,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:47:49,520 INFO L87 Difference]: Start difference. First operand 187 states and 193 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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:47:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:47:49,837 INFO L93 Difference]: Finished difference Result 187 states and 193 transitions. [2021-11-06 10:47:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:47:49,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-11-06 10:47:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:47:49,838 INFO L225 Difference]: With dead ends: 187 [2021-11-06 10:47:49,838 INFO L226 Difference]: Without dead ends: 185 [2021-11-06 10:47:49,839 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:47:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-06 10:47:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-11-06 10:47:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 177 states have (on average 1.07909604519774) internal successors, (191), 184 states have internal predecessors, (191), 0 states have call successors, (0), 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:47:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 191 transitions. [2021-11-06 10:47:49,845 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 191 transitions. Word has length 83 [2021-11-06 10:47:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:47:49,845 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 191 transitions. [2021-11-06 10:47:49,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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:47:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 191 transitions. [2021-11-06 10:47:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 10:47:49,846 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:47:49,846 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] [2021-11-06 10:47:49,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 10:47:49,846 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:47:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:47:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2141976047, now seen corresponding path program 1 times [2021-11-06 10:47:49,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:47:49,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637273394] [2021-11-06 10:47:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:47:49,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:47:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:47:50,134 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:47:50,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:47:50,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637273394] [2021-11-06 10:47:50,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637273394] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:47:50,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:47:50,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:47:50,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592891820] [2021-11-06 10:47:50,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:47:50,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:47:50,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:47:50,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:47:50,135 INFO L87 Difference]: Start difference. First operand 185 states and 191 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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:47:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:47:52,521 INFO L93 Difference]: Finished difference Result 201 states and 206 transitions. [2021-11-06 10:47:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:47:52,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-11-06 10:47:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:47:52,523 INFO L225 Difference]: With dead ends: 201 [2021-11-06 10:47:52,523 INFO L226 Difference]: Without dead ends: 185 [2021-11-06 10:47:52,523 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:47:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-06 10:47:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-11-06 10:47:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 177 states have (on average 1.073446327683616) internal successors, (190), 184 states have internal predecessors, (190), 0 states have call successors, (0), 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:47:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 190 transitions. [2021-11-06 10:47:52,529 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 190 transitions. Word has length 84 [2021-11-06 10:47:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:47:52,529 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 190 transitions. [2021-11-06 10:47:52,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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:47:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2021-11-06 10:47:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 10:47:52,530 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:47:52,530 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] [2021-11-06 10:47:52,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 10:47:52,530 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:47:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:47:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1982017560, now seen corresponding path program 1 times [2021-11-06 10:47:52,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:47:52,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785725416] [2021-11-06 10:47:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:47:52,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:47:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:47:53,089 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:47:53,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:47:53,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785725416] [2021-11-06 10:47:53,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785725416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:47:53,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:47:53,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:47:53,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160031821] [2021-11-06 10:47:53,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:47:53,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:47:53,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:47:53,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:47:53,090 INFO L87 Difference]: Start difference. First operand 185 states and 190 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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:48:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:00,465 INFO L93 Difference]: Finished difference Result 295 states and 304 transitions. [2021-11-06 10:48:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:48:00,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-11-06 10:48:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:00,466 INFO L225 Difference]: With dead ends: 295 [2021-11-06 10:48:00,466 INFO L226 Difference]: Without dead ends: 239 [2021-11-06 10:48:00,467 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:48:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-06 10:48:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 194. [2021-11-06 10:48:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 186 states have (on average 1.0698924731182795) internal successors, (199), 193 states have internal predecessors, (199), 0 states have call successors, (0), 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:48:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 199 transitions. [2021-11-06 10:48:00,473 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 199 transitions. Word has length 84 [2021-11-06 10:48:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:00,473 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 199 transitions. [2021-11-06 10:48:00,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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:48:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 199 transitions. [2021-11-06 10:48:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 10:48:00,474 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:00,474 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] [2021-11-06 10:48:00,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 10:48:00,474 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:48:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:00,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1976993750, now seen corresponding path program 1 times [2021-11-06 10:48:00,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:00,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281593897] [2021-11-06 10:48:00,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:00,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:03,558 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:48:03,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:03,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281593897] [2021-11-06 10:48:03,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281593897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:03,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:03,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:48:03,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226802515] [2021-11-06 10:48:03,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:48:03,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:03,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:48:03,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:48:03,569 INFO L87 Difference]: Start difference. First operand 194 states and 199 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 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:48:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:16,044 INFO L93 Difference]: Finished difference Result 237 states and 243 transitions. [2021-11-06 10:48:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:48:16,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-11-06 10:48:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:16,045 INFO L225 Difference]: With dead ends: 237 [2021-11-06 10:48:16,045 INFO L226 Difference]: Without dead ends: 235 [2021-11-06 10:48:16,046 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:48:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-06 10:48:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2021-11-06 10:48:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 195 states have (on average 1.0666666666666667) internal successors, (208), 202 states have internal predecessors, (208), 0 states have call successors, (0), 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:48:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 208 transitions. [2021-11-06 10:48:16,053 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 208 transitions. Word has length 85 [2021-11-06 10:48:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:16,053 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 208 transitions. [2021-11-06 10:48:16,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 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:48:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 208 transitions. [2021-11-06 10:48:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:48:16,054 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:16,054 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] [2021-11-06 10:48:16,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 10:48:16,054 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:48:16,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:16,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1515583928, now seen corresponding path program 1 times [2021-11-06 10:48:16,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:16,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921043391] [2021-11-06 10:48:16,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:16,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:21,191 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:48:21,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:21,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921043391] [2021-11-06 10:48:21,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921043391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:21,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:21,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 10:48:21,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478968819] [2021-11-06 10:48:21,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 10:48:21,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:21,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 10:48:21,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:48:21,193 INFO L87 Difference]: Start difference. First operand 203 states and 208 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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:48:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:26,886 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2021-11-06 10:48:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:48:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-11-06 10:48:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:26,887 INFO L225 Difference]: With dead ends: 235 [2021-11-06 10:48:26,887 INFO L226 Difference]: Without dead ends: 233 [2021-11-06 10:48:26,887 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:48:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-06 10:48:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 205. [2021-11-06 10:48:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 197 states have (on average 1.0659898477157361) internal successors, (210), 204 states have internal predecessors, (210), 0 states have call successors, (0), 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:48:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 210 transitions. [2021-11-06 10:48:26,909 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 210 transitions. Word has length 87 [2021-11-06 10:48:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:26,910 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 210 transitions. [2021-11-06 10:48:26,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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:48:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 210 transitions. [2021-11-06 10:48:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 10:48:26,910 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:26,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] [2021-11-06 10:48:26,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 10:48:26,910 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:48:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash 482376762, now seen corresponding path program 1 times [2021-11-06 10:48:26,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:26,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370615644] [2021-11-06 10:48:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:26,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:32,446 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:48:32,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:32,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370615644] [2021-11-06 10:48:32,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370615644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:32,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:32,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:48:32,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937621955] [2021-11-06 10:48:32,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:48:32,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:32,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:48:32,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:48:32,448 INFO L87 Difference]: Start difference. First operand 205 states and 210 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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:48:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:48:46,970 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2021-11-06 10:48:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:48:46,971 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-11-06 10:48:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:48:46,972 INFO L225 Difference]: With dead ends: 235 [2021-11-06 10:48:46,972 INFO L226 Difference]: Without dead ends: 233 [2021-11-06 10:48:46,972 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:48:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-06 10:48:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 207. [2021-11-06 10:48:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 199 states have (on average 1.065326633165829) internal successors, (212), 206 states have internal predecessors, (212), 0 states have call successors, (0), 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:48:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 212 transitions. [2021-11-06 10:48:46,981 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 212 transitions. Word has length 89 [2021-11-06 10:48:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:48:46,982 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 212 transitions. [2021-11-06 10:48:46,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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:48:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 212 transitions. [2021-11-06 10:48:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:48:46,982 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:48:46,983 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:48:46,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 10:48:46,983 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:48:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:48:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1692912129, now seen corresponding path program 1 times [2021-11-06 10:48:46,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:48:46,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594396532] [2021-11-06 10:48:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:48:46,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:48:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:48:48,926 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:48:48,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:48:48,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594396532] [2021-11-06 10:48:48,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594396532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:48:48,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:48:48,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-06 10:48:48,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959305369] [2021-11-06 10:48:48,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 10:48:48,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:48:48,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 10:48:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:48:48,929 INFO L87 Difference]: Start difference. First operand 207 states and 212 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 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:49:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:49:02,441 INFO L93 Difference]: Finished difference Result 247 states and 252 transitions. [2021-11-06 10:49:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:49:02,442 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 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:49:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:49:02,442 INFO L225 Difference]: With dead ends: 247 [2021-11-06 10:49:02,442 INFO L226 Difference]: Without dead ends: 225 [2021-11-06 10:49:02,443 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:49:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-06 10:49:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 209. [2021-11-06 10:49:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 201 states have (on average 1.064676616915423) internal successors, (214), 208 states have internal predecessors, (214), 0 states have call successors, (0), 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:49:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 214 transitions. [2021-11-06 10:49:02,463 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 214 transitions. Word has length 93 [2021-11-06 10:49:02,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:49:02,464 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 214 transitions. [2021-11-06 10:49:02,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 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:49:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 214 transitions. [2021-11-06 10:49:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:49:02,464 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:49:02,464 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:49:02,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-06 10:49:02,464 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:49:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:49:02,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1692359010, now seen corresponding path program 1 times [2021-11-06 10:49:02,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:49:02,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068840811] [2021-11-06 10:49:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:49:02,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:49:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:49:05,120 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:49:05,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:49:05,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068840811] [2021-11-06 10:49:05,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068840811] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:49:05,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:49:05,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:49:05,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624720134] [2021-11-06 10:49:05,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:49:05,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:49:05,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:49:05,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:49:05,122 INFO L87 Difference]: Start difference. First operand 209 states and 214 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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:49:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:49:16,785 INFO L93 Difference]: Finished difference Result 209 states and 214 transitions. [2021-11-06 10:49:16,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:49:16,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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:49:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:49:16,787 INFO L225 Difference]: With dead ends: 209 [2021-11-06 10:49:16,787 INFO L226 Difference]: Without dead ends: 207 [2021-11-06 10:49:16,787 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:49:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-06 10:49:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-06 10:49:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 200 states have (on average 1.06) internal successors, (212), 206 states have internal predecessors, (212), 0 states have call successors, (0), 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:49:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 212 transitions. [2021-11-06 10:49:16,795 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 212 transitions. Word has length 93 [2021-11-06 10:49:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:49:16,796 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 212 transitions. [2021-11-06 10:49:16,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 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:49:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 212 transitions. [2021-11-06 10:49:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 10:49:16,796 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:49:16,796 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:49:16,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-06 10:49:16,797 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:49:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:49:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash 274524824, now seen corresponding path program 1 times [2021-11-06 10:49:16,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:49:16,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007671107] [2021-11-06 10:49:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:49:16,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:49:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:49:22,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:49:22,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:49:22,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007671107] [2021-11-06 10:49:22,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007671107] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:49:22,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:49:22,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:49:22,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350227350] [2021-11-06 10:49:22,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 10:49:22,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:49:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 10:49:22,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:49:22,563 INFO L87 Difference]: Start difference. First operand 207 states and 212 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 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:49:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:49:30,287 INFO L93 Difference]: Finished difference Result 260 states and 265 transitions. [2021-11-06 10:49:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 10:49:30,288 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 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:49:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:49:30,288 INFO L225 Difference]: With dead ends: 260 [2021-11-06 10:49:30,288 INFO L226 Difference]: Without dead ends: 216 [2021-11-06 10:49:30,289 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2021-11-06 10:49:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-06 10:49:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2021-11-06 10:49:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.0515463917525774) internal successors, (204), 199 states have internal predecessors, (204), 0 states have call successors, (0), 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:49:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 204 transitions. [2021-11-06 10:49:30,302 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 204 transitions. Word has length 93 [2021-11-06 10:49:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:49:30,303 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 204 transitions. [2021-11-06 10:49:30,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 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:49:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 204 transitions. [2021-11-06 10:49:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-06 10:49:30,304 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:49:30,304 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:49:30,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-06 10:49:30,304 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:49:30,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:49:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1084636378, now seen corresponding path program 1 times [2021-11-06 10:49:30,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:49:30,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107270160] [2021-11-06 10:49:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:49:30,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:49:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:49:31,439 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:49:31,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:49:31,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107270160] [2021-11-06 10:49:31,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107270160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:49:31,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:49:31,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:49:31,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498153909] [2021-11-06 10:49:31,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:49:31,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:49:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:49:31,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:49:31,441 INFO L87 Difference]: Start difference. First operand 200 states and 204 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:49:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:49:41,323 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2021-11-06 10:49:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:49:41,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:49:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:49:41,325 INFO L225 Difference]: With dead ends: 255 [2021-11-06 10:49:41,325 INFO L226 Difference]: Without dead ends: 214 [2021-11-06 10:49:41,325 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:49:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-11-06 10:49:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200. [2021-11-06 10:49:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 199 states have internal predecessors, (203), 0 states have call successors, (0), 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:49:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 203 transitions. [2021-11-06 10:49:41,333 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 203 transitions. Word has length 94 [2021-11-06 10:49:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:49:41,333 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 203 transitions. [2021-11-06 10:49:41,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:49:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 203 transitions. [2021-11-06 10:49:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-06 10:49:41,334 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:49:41,334 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] [2021-11-06 10:49:41,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-06 10:49:41,334 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:49:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:49:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1558056205, now seen corresponding path program 1 times [2021-11-06 10:49:41,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:49:41,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142947795] [2021-11-06 10:49:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:49:41,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:49:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:49:42,496 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:49:42,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:49:42,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142947795] [2021-11-06 10:49:42,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142947795] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:49:42,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:49:42,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:49:42,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104826706] [2021-11-06 10:49:42,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:49:42,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:49:42,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:49:42,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:49:42,498 INFO L87 Difference]: Start difference. First operand 200 states and 203 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 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:49:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:49:54,362 INFO L93 Difference]: Finished difference Result 214 states and 216 transitions. [2021-11-06 10:49:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:49:54,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-11-06 10:49:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:49:54,363 INFO L225 Difference]: With dead ends: 214 [2021-11-06 10:49:54,363 INFO L226 Difference]: Without dead ends: 212 [2021-11-06 10:49:54,363 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:49:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-06 10:49:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2021-11-06 10:49:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 199 states have (on average 1.0452261306532664) internal successors, (208), 204 states have internal predecessors, (208), 0 states have call successors, (0), 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:49:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 208 transitions. [2021-11-06 10:49:54,371 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 208 transitions. Word has length 96 [2021-11-06 10:49:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:49:54,372 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 208 transitions. [2021-11-06 10:49:54,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 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:49:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 208 transitions. [2021-11-06 10:49:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-06 10:49:54,372 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:49:54,372 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] [2021-11-06 10:49:54,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-06 10:49:54,373 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:49:54,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:49:54,373 INFO L85 PathProgramCache]: Analyzing trace with hash -758827371, now seen corresponding path program 1 times [2021-11-06 10:49:54,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:49:54,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11625683] [2021-11-06 10:49:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:49:54,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:49:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:50:02,263 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:50:02,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:50:02,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11625683] [2021-11-06 10:50:02,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11625683] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:50:02,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:50:02,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-06 10:50:02,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752159214] [2021-11-06 10:50:02,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-06 10:50:02,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:50:02,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-06 10:50:02,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2021-11-06 10:50:02,264 INFO L87 Difference]: Start difference. First operand 205 states and 208 transitions. Second operand has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 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:50:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:50:19,184 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2021-11-06 10:50:19,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:50:19,185 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-11-06 10:50:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:50:19,185 INFO L225 Difference]: With dead ends: 212 [2021-11-06 10:50:19,185 INFO L226 Difference]: Without dead ends: 210 [2021-11-06 10:50:19,186 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2021-11-06 10:50:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-06 10:50:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2021-11-06 10:50:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.0404040404040404) internal successors, (206), 202 states have internal predecessors, (206), 0 states have call successors, (0), 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:50:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 206 transitions. [2021-11-06 10:50:19,194 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 206 transitions. Word has length 100 [2021-11-06 10:50:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:50:19,194 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 206 transitions. [2021-11-06 10:50:19,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 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:50:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 206 transitions. [2021-11-06 10:50:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-06 10:50:19,195 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:50:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:19,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-06 10:50:19,196 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:50:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:50:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash 970156395, now seen corresponding path program 1 times [2021-11-06 10:50:19,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:50:19,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002159041] [2021-11-06 10:50:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:50:19,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:50:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:50:20,418 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:50:20,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:50:20,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002159041] [2021-11-06 10:50:20,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002159041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:50:20,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:50:20,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:50:20,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708519724] [2021-11-06 10:50:20,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:50:20,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:50:20,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:50:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:50:20,426 INFO L87 Difference]: Start difference. First operand 203 states and 206 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:50:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:50:25,202 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2021-11-06 10:50:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:50:25,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:50:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:50:25,203 INFO L225 Difference]: With dead ends: 217 [2021-11-06 10:50:25,203 INFO L226 Difference]: Without dead ends: 137 [2021-11-06 10:50:25,203 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:50:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-06 10:50:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-11-06 10:50:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0538461538461539) internal successors, (137), 134 states have internal predecessors, (137), 0 states have call successors, (0), 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:50:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2021-11-06 10:50:25,209 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 101 [2021-11-06 10:50:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:50:25,224 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2021-11-06 10:50:25,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:50:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2021-11-06 10:50:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 10:50:25,225 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:50:25,225 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] [2021-11-06 10:50:25,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-06 10:50:25,226 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:50:25,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:50:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash 911471799, now seen corresponding path program 1 times [2021-11-06 10:50:25,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:50:25,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014370404] [2021-11-06 10:50:25,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:50:25,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:50:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:50:36,950 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:50:36,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:50:36,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014370404] [2021-11-06 10:50:36,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014370404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:50:36,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:50:36,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-06 10:50:36,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441021556] [2021-11-06 10:50:36,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 10:50:36,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:50:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 10:50:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:50:36,952 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 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:50:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:50:50,749 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2021-11-06 10:50:50,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:50:50,750 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2021-11-06 10:50:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:50:50,750 INFO L225 Difference]: With dead ends: 135 [2021-11-06 10:50:50,750 INFO L226 Difference]: Without dead ends: 133 [2021-11-06 10:50:50,751 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2021-11-06 10:50:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-06 10:50:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-11-06 10:50:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.0465116279069768) internal successors, (135), 132 states have internal predecessors, (135), 0 states have call successors, (0), 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:50:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2021-11-06 10:50:50,757 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 102 [2021-11-06 10:50:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:50:50,757 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2021-11-06 10:50:50,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 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:50:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2021-11-06 10:50:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-06 10:50:50,758 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:50:50,758 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] [2021-11-06 10:50:50,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-06 10:50:50,758 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:50:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:50:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash -248794247, now seen corresponding path program 1 times [2021-11-06 10:50:50,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:50:50,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141981753] [2021-11-06 10:50:50,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:50:50,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:50:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:50:55,787 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:50:55,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:50:55,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141981753] [2021-11-06 10:50:55,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141981753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:50:55,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:50:55,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:50:55,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052082414] [2021-11-06 10:50:55,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:50:55,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:50:55,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:50:55,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:50:55,789 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:51:14,290 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2021-11-06 10:51:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 10:51:14,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2021-11-06 10:51:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:51:14,291 INFO L225 Difference]: With dead ends: 135 [2021-11-06 10:51:14,291 INFO L226 Difference]: Without dead ends: 133 [2021-11-06 10:51:14,291 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:51:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-06 10:51:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2021-11-06 10:51:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.0390625) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 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:51:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2021-11-06 10:51:14,297 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 104 [2021-11-06 10:51:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:51:14,298 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2021-11-06 10:51:14,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 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:51:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2021-11-06 10:51:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-06 10:51:14,298 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:51:14,298 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:51:14,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-06 10:51:14,299 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 10:51:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:51:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1283962302, now seen corresponding path program 1 times [2021-11-06 10:51:14,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:51:14,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664998836] [2021-11-06 10:51:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:51:14,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:51:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15