./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.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 e0c2b6cb89e48a11e817cc51933cd8194bf8c1187502e8ea2a988dbf620106e5 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:34:37,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:34:37,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:34:37,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:34:37,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:34:37,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:34:37,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:34:37,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:34:37,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:34:37,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:34:37,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:34:37,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:34:37,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:34:37,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:34:37,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:34:37,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:34:37,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:34:37,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:34:37,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:34:37,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:34:37,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:34:37,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:34:37,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:34:37,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:34:37,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:34:37,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:34:37,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:34:37,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:34:37,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:34:37,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:34:37,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:34:37,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:34:37,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:34:37,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:34:37,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:34:37,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:34:37,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:34:37,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:34:37,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:34:37,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:34:37,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:34:37,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 21:34:37,714 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:34:37,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:34:37,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:34:37,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:34:37,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:34:37,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:34:37,717 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:34:37,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:34:37,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:34:37,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:34:37,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:34:37,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:34:37,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:34:37,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:34:37,718 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:34:37,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:34:37,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:34:37,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:34:37,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:34:37,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:34:37,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:34:37,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:34:37,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:34:37,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:34:37,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:34:37,720 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:34:37,721 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:34:37,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:34:37,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:34:37,721 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 -> e0c2b6cb89e48a11e817cc51933cd8194bf8c1187502e8ea2a988dbf620106e5 [2021-11-06 21:34:37,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:34:37,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:34:37,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:34:37,957 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:34:37,958 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:34:37,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i [2021-11-06 21:34:38,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ebde2eb/5b1cc09249c04e3b994529051fec035d/FLAG55eb1cb1b [2021-11-06 21:34:38,811 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:34:38,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i [2021-11-06 21:34:38,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ebde2eb/5b1cc09249c04e3b994529051fec035d/FLAG55eb1cb1b [2021-11-06 21:34:38,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ebde2eb/5b1cc09249c04e3b994529051fec035d [2021-11-06 21:34:38,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:34:38,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:34:38,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:34:38,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:34:39,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:34:39,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:34:38" (1/1) ... [2021-11-06 21:34:39,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e906ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:39, skipping insertion in model container [2021-11-06 21:34:39,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:34:38" (1/1) ... [2021-11-06 21:34:39,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:34:39,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:34:41,793 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341006,341019] [2021-11-06 21:34:41,796 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341151,341164] [2021-11-06 21:34:41,796 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341297,341310] [2021-11-06 21:34:41,797 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341462,341475] [2021-11-06 21:34:41,797 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341620,341633] [2021-11-06 21:34:41,802 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341778,341791] [2021-11-06 21:34:41,804 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341936,341949] [2021-11-06 21:34:41,804 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342096,342109] [2021-11-06 21:34:41,805 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342255,342268] [2021-11-06 21:34:41,805 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342394,342407] [2021-11-06 21:34:41,806 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342536,342549] [2021-11-06 21:34:41,806 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342685,342698] [2021-11-06 21:34:41,807 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342824,342837] [2021-11-06 21:34:41,811 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342979,342992] [2021-11-06 21:34:41,812 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343139,343152] [2021-11-06 21:34:41,812 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343290,343303] [2021-11-06 21:34:41,813 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343441,343454] [2021-11-06 21:34:41,814 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343593,343606] [2021-11-06 21:34:41,815 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343742,343755] [2021-11-06 21:34:41,815 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343890,343903] [2021-11-06 21:34:41,816 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344047,344060] [2021-11-06 21:34:41,816 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344196,344209] [2021-11-06 21:34:41,816 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344352,344365] [2021-11-06 21:34:41,817 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344505,344518] [2021-11-06 21:34:41,817 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344651,344664] [2021-11-06 21:34:41,819 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344794,344807] [2021-11-06 21:34:41,819 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344946,344959] [2021-11-06 21:34:41,820 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345092,345105] [2021-11-06 21:34:41,821 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345237,345250] [2021-11-06 21:34:41,822 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345391,345404] [2021-11-06 21:34:41,822 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345542,345555] [2021-11-06 21:34:41,822 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345697,345710] [2021-11-06 21:34:41,823 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345849,345862] [2021-11-06 21:34:41,824 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346004,346017] [2021-11-06 21:34:41,824 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346168,346181] [2021-11-06 21:34:41,824 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346324,346337] [2021-11-06 21:34:41,825 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346488,346501] [2021-11-06 21:34:41,825 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346630,346643] [2021-11-06 21:34:41,826 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346788,346801] [2021-11-06 21:34:41,826 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346955,346968] [2021-11-06 21:34:41,827 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347114,347127] [2021-11-06 21:34:41,827 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347273,347286] [2021-11-06 21:34:41,827 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347422,347435] [2021-11-06 21:34:41,828 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347569,347582] [2021-11-06 21:34:41,828 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347708,347721] [2021-11-06 21:34:41,828 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347871,347884] [2021-11-06 21:34:41,829 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348037,348050] [2021-11-06 21:34:41,830 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348201,348214] [2021-11-06 21:34:41,830 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348366,348379] [2021-11-06 21:34:41,830 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348531,348544] [2021-11-06 21:34:41,831 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348697,348710] [2021-11-06 21:34:41,831 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348862,348875] [2021-11-06 21:34:41,832 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349029,349042] [2021-11-06 21:34:41,832 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349189,349202] [2021-11-06 21:34:41,833 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349351,349364] [2021-11-06 21:34:41,833 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349510,349523] [2021-11-06 21:34:41,833 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349656,349669] [2021-11-06 21:34:41,834 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349799,349812] [2021-11-06 21:34:41,834 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349943,349956] [2021-11-06 21:34:41,834 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350086,350099] [2021-11-06 21:34:41,835 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350230,350243] [2021-11-06 21:34:41,835 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350371,350384] [2021-11-06 21:34:41,836 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350509,350522] [2021-11-06 21:34:41,836 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350667,350680] [2021-11-06 21:34:41,836 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350826,350839] [2021-11-06 21:34:41,837 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350982,350995] [2021-11-06 21:34:41,837 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351131,351144] [2021-11-06 21:34:41,837 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351283,351296] [2021-11-06 21:34:41,838 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351434,351447] [2021-11-06 21:34:41,838 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351583,351596] [2021-11-06 21:34:41,838 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351735,351748] [2021-11-06 21:34:41,839 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351883,351896] [2021-11-06 21:34:41,839 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352036,352049] [2021-11-06 21:34:41,839 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352187,352200] [2021-11-06 21:34:41,840 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352337,352350] [2021-11-06 21:34:41,840 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352484,352497] [2021-11-06 21:34:41,840 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352635,352648] [2021-11-06 21:34:41,841 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352786,352799] [2021-11-06 21:34:41,841 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352934,352947] [2021-11-06 21:34:41,841 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353100,353113] [2021-11-06 21:34:41,842 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353269,353282] [2021-11-06 21:34:41,842 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353436,353449] [2021-11-06 21:34:41,842 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353604,353617] [2021-11-06 21:34:41,843 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353754,353767] [2021-11-06 21:34:41,843 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353901,353914] [2021-11-06 21:34:41,844 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354062,354075] [2021-11-06 21:34:41,844 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354232,354245] [2021-11-06 21:34:41,844 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354394,354407] [2021-11-06 21:34:41,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:34:41,901 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:34:42,177 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341006,341019] [2021-11-06 21:34:42,178 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341151,341164] [2021-11-06 21:34:42,178 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341297,341310] [2021-11-06 21:34:42,179 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341462,341475] [2021-11-06 21:34:42,180 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341620,341633] [2021-11-06 21:34:42,180 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341778,341791] [2021-11-06 21:34:42,181 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341936,341949] [2021-11-06 21:34:42,181 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342096,342109] [2021-11-06 21:34:42,182 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342255,342268] [2021-11-06 21:34:42,182 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342394,342407] [2021-11-06 21:34:42,182 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342536,342549] [2021-11-06 21:34:42,183 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342685,342698] [2021-11-06 21:34:42,184 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342824,342837] [2021-11-06 21:34:42,184 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342979,342992] [2021-11-06 21:34:42,185 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343139,343152] [2021-11-06 21:34:42,185 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343290,343303] [2021-11-06 21:34:42,185 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343441,343454] [2021-11-06 21:34:42,186 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343593,343606] [2021-11-06 21:34:42,186 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343742,343755] [2021-11-06 21:34:42,186 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343890,343903] [2021-11-06 21:34:42,187 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344047,344060] [2021-11-06 21:34:42,188 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344196,344209] [2021-11-06 21:34:42,188 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344352,344365] [2021-11-06 21:34:42,189 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344505,344518] [2021-11-06 21:34:42,189 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344651,344664] [2021-11-06 21:34:42,190 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344794,344807] [2021-11-06 21:34:42,190 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344946,344959] [2021-11-06 21:34:42,190 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345092,345105] [2021-11-06 21:34:42,191 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345237,345250] [2021-11-06 21:34:42,191 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345391,345404] [2021-11-06 21:34:42,191 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345542,345555] [2021-11-06 21:34:42,192 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345697,345710] [2021-11-06 21:34:42,192 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345849,345862] [2021-11-06 21:34:42,192 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346004,346017] [2021-11-06 21:34:42,193 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346168,346181] [2021-11-06 21:34:42,193 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346324,346337] [2021-11-06 21:34:42,194 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346488,346501] [2021-11-06 21:34:42,197 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346630,346643] [2021-11-06 21:34:42,198 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346788,346801] [2021-11-06 21:34:42,198 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346955,346968] [2021-11-06 21:34:42,199 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347114,347127] [2021-11-06 21:34:42,200 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347273,347286] [2021-11-06 21:34:42,200 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347422,347435] [2021-11-06 21:34:42,201 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347569,347582] [2021-11-06 21:34:42,201 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347708,347721] [2021-11-06 21:34:42,201 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347871,347884] [2021-11-06 21:34:42,202 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348037,348050] [2021-11-06 21:34:42,202 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348201,348214] [2021-11-06 21:34:42,203 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348366,348379] [2021-11-06 21:34:42,203 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348531,348544] [2021-11-06 21:34:42,204 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348697,348710] [2021-11-06 21:34:42,204 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348862,348875] [2021-11-06 21:34:42,204 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349029,349042] [2021-11-06 21:34:42,205 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349189,349202] [2021-11-06 21:34:42,205 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349351,349364] [2021-11-06 21:34:42,206 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349510,349523] [2021-11-06 21:34:42,206 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349656,349669] [2021-11-06 21:34:42,206 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349799,349812] [2021-11-06 21:34:42,207 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349943,349956] [2021-11-06 21:34:42,207 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350086,350099] [2021-11-06 21:34:42,207 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350230,350243] [2021-11-06 21:34:42,208 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350371,350384] [2021-11-06 21:34:42,212 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350509,350522] [2021-11-06 21:34:42,214 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350667,350680] [2021-11-06 21:34:42,214 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350826,350839] [2021-11-06 21:34:42,217 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350982,350995] [2021-11-06 21:34:42,217 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351131,351144] [2021-11-06 21:34:42,218 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351283,351296] [2021-11-06 21:34:42,218 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351434,351447] [2021-11-06 21:34:42,219 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351583,351596] [2021-11-06 21:34:42,219 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351735,351748] [2021-11-06 21:34:42,220 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351883,351896] [2021-11-06 21:34:42,220 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352036,352049] [2021-11-06 21:34:42,220 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352187,352200] [2021-11-06 21:34:42,226 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352337,352350] [2021-11-06 21:34:42,226 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352484,352497] [2021-11-06 21:34:42,227 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352635,352648] [2021-11-06 21:34:42,227 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352786,352799] [2021-11-06 21:34:42,228 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352934,352947] [2021-11-06 21:34:42,229 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353100,353113] [2021-11-06 21:34:42,229 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353269,353282] [2021-11-06 21:34:42,230 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353436,353449] [2021-11-06 21:34:42,230 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353604,353617] [2021-11-06 21:34:42,230 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353754,353767] [2021-11-06 21:34:42,231 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353901,353914] [2021-11-06 21:34:42,231 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354062,354075] [2021-11-06 21:34:42,231 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354232,354245] [2021-11-06 21:34:42,232 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/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354394,354407] [2021-11-06 21:34:42,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:34:42,438 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:34:42,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42 WrapperNode [2021-11-06 21:34:42,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:34:42,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:34:42,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:34:42,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:34:42,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:42,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:43,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:34:43,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:34:43,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:34:43,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:34:43,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:43,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:43,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:43,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:43,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:43,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:43,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:43,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:34:43,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:34:43,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:34:43,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:34:44,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (1/1) ... [2021-11-06 21:34:44,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:34:44,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:34:44,027 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 21:34:44,043 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 21:34:44,096 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 21:34:44,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:34:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:34:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:34:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:34:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:34:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:34:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:34:44,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:34:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:34:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:34:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:34:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:34:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:34:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:34:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:35:06,201 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L7909: #t~ret1115 := main_#res; [2021-11-06 21:35:06,202 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_12_returnLabel: main_#res := 0; [2021-11-06 21:35:06,202 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:35:06,227 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:35:06,227 INFO L299 CfgBuilder]: Removed 3235 assume(true) statements. [2021-11-06 21:35:06,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:35:06 BoogieIcfgContainer [2021-11-06 21:35:06,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:35:06,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:35:06,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:35:06,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:35:06,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:34:38" (1/3) ... [2021-11-06 21:35:06,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bc4d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:35:06, skipping insertion in model container [2021-11-06 21:35:06,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:34:42" (2/3) ... [2021-11-06 21:35:06,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bc4d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:35:06, skipping insertion in model container [2021-11-06 21:35:06,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:35:06" (3/3) ... [2021-11-06 21:35:06,239 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i [2021-11-06 21:35:06,243 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:35:06,243 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 150 error locations. [2021-11-06 21:35:06,290 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:35:06,294 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 21:35:06,294 INFO L340 AbstractCegarLoop]: Starting to check reachability of 150 error locations. [2021-11-06 21:35:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 3294 states, 3144 states have (on average 1.400763358778626) internal successors, (4404), 3293 states have internal predecessors, (4404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 21:35:06,345 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:06,345 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 21:35:06,346 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:06,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1793261304, now seen corresponding path program 1 times [2021-11-06 21:35:06,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:06,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980405545] [2021-11-06 21:35:06,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:06,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:07,080 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 21:35:07,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:07,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980405545] [2021-11-06 21:35:07,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980405545] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:07,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:07,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:07,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114572940] [2021-11-06 21:35:07,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:07,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:07,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:07,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:07,111 INFO L87 Difference]: Start difference. First operand has 3294 states, 3144 states have (on average 1.400763358778626) internal successors, (4404), 3293 states have internal predecessors, (4404), 0 states have call successors, (0), 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 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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 21:35:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:07,315 INFO L93 Difference]: Finished difference Result 6514 states and 8715 transitions. [2021-11-06 21:35:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:07,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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 21:35:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:07,339 INFO L225 Difference]: With dead ends: 6514 [2021-11-06 21:35:07,339 INFO L226 Difference]: Without dead ends: 3194 [2021-11-06 21:35:07,348 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2021-11-06 21:35:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2021-11-06 21:35:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3046 states have (on average 1.3322390019697965) internal successors, (4058), 3193 states have internal predecessors, (4058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4058 transitions. [2021-11-06 21:35:07,469 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4058 transitions. Word has length 29 [2021-11-06 21:35:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:07,473 INFO L470 AbstractCegarLoop]: Abstraction has 3194 states and 4058 transitions. [2021-11-06 21:35:07,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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 21:35:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4058 transitions. [2021-11-06 21:35:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 21:35:07,475 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:07,475 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] [2021-11-06 21:35:07,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:35:07,475 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:07,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1041958100, now seen corresponding path program 1 times [2021-11-06 21:35:07,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:07,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615989766] [2021-11-06 21:35:07,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:07,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:07,758 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 21:35:07,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:07,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615989766] [2021-11-06 21:35:07,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615989766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:07,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:07,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:07,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244531067] [2021-11-06 21:35:07,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:07,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:07,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:07,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:07,762 INFO L87 Difference]: Start difference. First operand 3194 states and 4058 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:07,872 INFO L93 Difference]: Finished difference Result 3194 states and 4058 transitions. [2021-11-06 21:35:07,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:07,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-11-06 21:35:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:07,884 INFO L225 Difference]: With dead ends: 3194 [2021-11-06 21:35:07,884 INFO L226 Difference]: Without dead ends: 3190 [2021-11-06 21:35:07,885 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2021-11-06 21:35:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3190. [2021-11-06 21:35:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 3044 states have (on average 1.3318002628120893) internal successors, (4054), 3189 states have internal predecessors, (4054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 4054 transitions. [2021-11-06 21:35:07,963 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 4054 transitions. Word has length 31 [2021-11-06 21:35:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:07,963 INFO L470 AbstractCegarLoop]: Abstraction has 3190 states and 4054 transitions. [2021-11-06 21:35:07,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 4054 transitions. [2021-11-06 21:35:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 21:35:07,965 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:07,965 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] [2021-11-06 21:35:07,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:35:07,966 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash -594084432, now seen corresponding path program 1 times [2021-11-06 21:35:07,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:07,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808377342] [2021-11-06 21:35:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:07,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:08,312 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 21:35:08,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:08,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808377342] [2021-11-06 21:35:08,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808377342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:08,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:08,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:08,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159028178] [2021-11-06 21:35:08,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:08,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:08,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:08,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:08,315 INFO L87 Difference]: Start difference. First operand 3190 states and 4054 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:08,437 INFO L93 Difference]: Finished difference Result 3190 states and 4054 transitions. [2021-11-06 21:35:08,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-06 21:35:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:08,451 INFO L225 Difference]: With dead ends: 3190 [2021-11-06 21:35:08,451 INFO L226 Difference]: Without dead ends: 3186 [2021-11-06 21:35:08,452 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2021-11-06 21:35:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3186. [2021-11-06 21:35:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3042 states have (on average 1.331360946745562) internal successors, (4050), 3185 states have internal predecessors, (4050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4050 transitions. [2021-11-06 21:35:08,563 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4050 transitions. Word has length 33 [2021-11-06 21:35:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:08,564 INFO L470 AbstractCegarLoop]: Abstraction has 3186 states and 4050 transitions. [2021-11-06 21:35:08,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4050 transitions. [2021-11-06 21:35:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 21:35:08,571 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:08,571 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] [2021-11-06 21:35:08,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:35:08,571 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:08,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:08,573 INFO L85 PathProgramCache]: Analyzing trace with hash 315781268, now seen corresponding path program 1 times [2021-11-06 21:35:08,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:08,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579098428] [2021-11-06 21:35:08,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:08,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:08,851 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 21:35:08,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:08,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579098428] [2021-11-06 21:35:08,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579098428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:08,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:08,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:08,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433060019] [2021-11-06 21:35:08,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:08,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:08,853 INFO L87 Difference]: Start difference. First operand 3186 states and 4050 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:08,988 INFO L93 Difference]: Finished difference Result 3186 states and 4050 transitions. [2021-11-06 21:35:08,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:08,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2021-11-06 21:35:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:09,000 INFO L225 Difference]: With dead ends: 3186 [2021-11-06 21:35:09,000 INFO L226 Difference]: Without dead ends: 3182 [2021-11-06 21:35:09,002 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2021-11-06 21:35:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3182. [2021-11-06 21:35:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3040 states have (on average 1.330921052631579) internal successors, (4046), 3181 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4046 transitions. [2021-11-06 21:35:09,114 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4046 transitions. Word has length 35 [2021-11-06 21:35:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:09,114 INFO L470 AbstractCegarLoop]: Abstraction has 3182 states and 4046 transitions. [2021-11-06 21:35:09,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4046 transitions. [2021-11-06 21:35:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 21:35:09,115 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:09,115 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] [2021-11-06 21:35:09,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:35:09,116 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1476609064, now seen corresponding path program 1 times [2021-11-06 21:35:09,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:09,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823042622] [2021-11-06 21:35:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:09,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:09,305 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 21:35:09,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:09,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823042622] [2021-11-06 21:35:09,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823042622] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:09,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:09,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:09,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105759410] [2021-11-06 21:35:09,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:09,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:09,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:09,308 INFO L87 Difference]: Start difference. First operand 3182 states and 4046 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:09,420 INFO L93 Difference]: Finished difference Result 3182 states and 4046 transitions. [2021-11-06 21:35:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:09,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-06 21:35:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:09,431 INFO L225 Difference]: With dead ends: 3182 [2021-11-06 21:35:09,431 INFO L226 Difference]: Without dead ends: 3178 [2021-11-06 21:35:09,433 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2021-11-06 21:35:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 3178. [2021-11-06 21:35:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3178 states, 3038 states have (on average 1.3304805793285055) internal successors, (4042), 3177 states have internal predecessors, (4042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4042 transitions. [2021-11-06 21:35:09,535 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4042 transitions. Word has length 37 [2021-11-06 21:35:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:09,536 INFO L470 AbstractCegarLoop]: Abstraction has 3178 states and 4042 transitions. [2021-11-06 21:35:09,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4042 transitions. [2021-11-06 21:35:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 21:35:09,538 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:09,538 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] [2021-11-06 21:35:09,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:35:09,539 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1681832068, now seen corresponding path program 1 times [2021-11-06 21:35:09,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:09,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912184107] [2021-11-06 21:35:09,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:09,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:09,742 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 21:35:09,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:09,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912184107] [2021-11-06 21:35:09,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912184107] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:09,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:09,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:09,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17159092] [2021-11-06 21:35:09,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:09,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:09,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:09,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:09,745 INFO L87 Difference]: Start difference. First operand 3178 states and 4042 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:09,860 INFO L93 Difference]: Finished difference Result 3178 states and 4042 transitions. [2021-11-06 21:35:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:09,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-11-06 21:35:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:09,871 INFO L225 Difference]: With dead ends: 3178 [2021-11-06 21:35:09,871 INFO L226 Difference]: Without dead ends: 3174 [2021-11-06 21:35:09,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2021-11-06 21:35:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 3174. [2021-11-06 21:35:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3174 states, 3036 states have (on average 1.3300395256916997) internal successors, (4038), 3173 states have internal predecessors, (4038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4038 transitions. [2021-11-06 21:35:09,964 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4038 transitions. Word has length 39 [2021-11-06 21:35:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:09,964 INFO L470 AbstractCegarLoop]: Abstraction has 3174 states and 4038 transitions. [2021-11-06 21:35:09,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4038 transitions. [2021-11-06 21:35:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 21:35:09,965 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:09,965 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 21:35:09,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:35:09,966 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:09,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1332642944, now seen corresponding path program 1 times [2021-11-06 21:35:09,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:09,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917655258] [2021-11-06 21:35:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:09,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:10,271 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 21:35:10,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:10,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917655258] [2021-11-06 21:35:10,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917655258] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:10,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:10,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:10,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138865952] [2021-11-06 21:35:10,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:10,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:10,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:10,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:10,273 INFO L87 Difference]: Start difference. First operand 3174 states and 4038 transitions. Second operand has 4 states, 4 states have (on average 10.25) 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 21:35:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:10,565 INFO L93 Difference]: Finished difference Result 5946 states and 7594 transitions. [2021-11-06 21:35:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:35:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) 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 21:35:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:10,588 INFO L225 Difference]: With dead ends: 5946 [2021-11-06 21:35:10,589 INFO L226 Difference]: Without dead ends: 5942 [2021-11-06 21:35:10,592 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2021-11-06 21:35:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 5659. [2021-11-06 21:35:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5659 states, 5521 states have (on average 1.338525629414961) internal successors, (7390), 5658 states have internal predecessors, (7390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5659 states to 5659 states and 7390 transitions. [2021-11-06 21:35:10,795 INFO L78 Accepts]: Start accepts. Automaton has 5659 states and 7390 transitions. Word has length 41 [2021-11-06 21:35:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:10,795 INFO L470 AbstractCegarLoop]: Abstraction has 5659 states and 7390 transitions. [2021-11-06 21:35:10,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) 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 21:35:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5659 states and 7390 transitions. [2021-11-06 21:35:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 21:35:10,797 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:10,797 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 21:35:10,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:35:10,797 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -769343516, now seen corresponding path program 1 times [2021-11-06 21:35:10,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:10,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136749590] [2021-11-06 21:35:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:10,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:10,985 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 21:35:10,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:10,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136749590] [2021-11-06 21:35:10,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136749590] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:10,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:10,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:10,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463437813] [2021-11-06 21:35:10,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:10,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:10,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:10,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:10,988 INFO L87 Difference]: Start difference. First operand 5659 states and 7390 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 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 21:35:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:11,163 INFO L93 Difference]: Finished difference Result 5659 states and 7390 transitions. [2021-11-06 21:35:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:11,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 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 21:35:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:11,198 INFO L225 Difference]: With dead ends: 5659 [2021-11-06 21:35:11,198 INFO L226 Difference]: Without dead ends: 5655 [2021-11-06 21:35:11,203 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2021-11-06 21:35:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 5655. [2021-11-06 21:35:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5655 states, 5519 states have (on average 1.3382859213625657) internal successors, (7386), 5654 states have internal predecessors, (7386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5655 states to 5655 states and 7386 transitions. [2021-11-06 21:35:11,403 INFO L78 Accepts]: Start accepts. Automaton has 5655 states and 7386 transitions. Word has length 43 [2021-11-06 21:35:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:11,405 INFO L470 AbstractCegarLoop]: Abstraction has 5655 states and 7386 transitions. [2021-11-06 21:35:11,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 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 21:35:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5655 states and 7386 transitions. [2021-11-06 21:35:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 21:35:11,406 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:11,406 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] [2021-11-06 21:35:11,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:35:11,407 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:11,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:11,407 INFO L85 PathProgramCache]: Analyzing trace with hash -604473145, now seen corresponding path program 1 times [2021-11-06 21:35:11,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:11,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566789261] [2021-11-06 21:35:11,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:11,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:11,612 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 21:35:11,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:11,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566789261] [2021-11-06 21:35:11,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566789261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:11,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:11,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:11,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035683490] [2021-11-06 21:35:11,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:11,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:11,614 INFO L87 Difference]: Start difference. First operand 5655 states and 7386 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:11,868 INFO L93 Difference]: Finished difference Result 5655 states and 7386 transitions. [2021-11-06 21:35:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:11,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2021-11-06 21:35:11,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:11,880 INFO L225 Difference]: With dead ends: 5655 [2021-11-06 21:35:11,880 INFO L226 Difference]: Without dead ends: 5651 [2021-11-06 21:35:11,881 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2021-11-06 21:35:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 5651. [2021-11-06 21:35:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5651 states, 5517 states have (on average 1.3380460395142288) internal successors, (7382), 5650 states have internal predecessors, (7382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5651 states to 5651 states and 7382 transitions. [2021-11-06 21:35:12,053 INFO L78 Accepts]: Start accepts. Automaton has 5651 states and 7382 transitions. Word has length 45 [2021-11-06 21:35:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:12,054 INFO L470 AbstractCegarLoop]: Abstraction has 5651 states and 7382 transitions. [2021-11-06 21:35:12,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5651 states and 7382 transitions. [2021-11-06 21:35:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 21:35:12,054 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:12,055 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 21:35:12,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:35:12,055 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:12,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:12,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1077835253, now seen corresponding path program 1 times [2021-11-06 21:35:12,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:12,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387824085] [2021-11-06 21:35:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:12,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:12,238 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 21:35:12,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:12,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387824085] [2021-11-06 21:35:12,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387824085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:12,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:12,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:12,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409578319] [2021-11-06 21:35:12,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:12,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:12,240 INFO L87 Difference]: Start difference. First operand 5651 states and 7382 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 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 21:35:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:12,414 INFO L93 Difference]: Finished difference Result 5651 states and 7382 transitions. [2021-11-06 21:35:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:12,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 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 21:35:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:12,427 INFO L225 Difference]: With dead ends: 5651 [2021-11-06 21:35:12,427 INFO L226 Difference]: Without dead ends: 5647 [2021-11-06 21:35:12,429 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5647 states. [2021-11-06 21:35:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5647 to 5647. [2021-11-06 21:35:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5647 states, 5515 states have (on average 1.3378059836808704) internal successors, (7378), 5646 states have internal predecessors, (7378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5647 states to 5647 states and 7378 transitions. [2021-11-06 21:35:12,610 INFO L78 Accepts]: Start accepts. Automaton has 5647 states and 7378 transitions. Word has length 47 [2021-11-06 21:35:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:12,611 INFO L470 AbstractCegarLoop]: Abstraction has 5647 states and 7378 transitions. [2021-11-06 21:35:12,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 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 21:35:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5647 states and 7378 transitions. [2021-11-06 21:35:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 21:35:12,612 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:12,612 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] [2021-11-06 21:35:12,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:35:12,613 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash -712287313, now seen corresponding path program 1 times [2021-11-06 21:35:12,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:12,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816547807] [2021-11-06 21:35:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:12,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:12,812 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 21:35:12,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:12,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816547807] [2021-11-06 21:35:12,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816547807] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:12,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:12,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:12,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305378786] [2021-11-06 21:35:12,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:12,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:12,815 INFO L87 Difference]: Start difference. First operand 5647 states and 7378 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:13,007 INFO L93 Difference]: Finished difference Result 5647 states and 7378 transitions. [2021-11-06 21:35:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:13,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-11-06 21:35:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:13,021 INFO L225 Difference]: With dead ends: 5647 [2021-11-06 21:35:13,021 INFO L226 Difference]: Without dead ends: 5643 [2021-11-06 21:35:13,024 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2021-11-06 21:35:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5643. [2021-11-06 21:35:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5643 states, 5513 states have (on average 1.3375657536731362) internal successors, (7374), 5642 states have internal predecessors, (7374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5643 states to 5643 states and 7374 transitions. [2021-11-06 21:35:13,268 INFO L78 Accepts]: Start accepts. Automaton has 5643 states and 7374 transitions. Word has length 49 [2021-11-06 21:35:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:13,269 INFO L470 AbstractCegarLoop]: Abstraction has 5643 states and 7374 transitions. [2021-11-06 21:35:13,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7374 transitions. [2021-11-06 21:35:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:35:13,270 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:13,270 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] [2021-11-06 21:35:13,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:35:13,270 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1608034893, now seen corresponding path program 1 times [2021-11-06 21:35:13,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:13,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551601250] [2021-11-06 21:35:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:13,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:13,441 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 21:35:13,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:13,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551601250] [2021-11-06 21:35:13,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551601250] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:13,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:13,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:13,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430931906] [2021-11-06 21:35:13,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:13,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:13,444 INFO L87 Difference]: Start difference. First operand 5643 states and 7374 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:13,640 INFO L93 Difference]: Finished difference Result 5643 states and 7374 transitions. [2021-11-06 21:35:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:13,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-06 21:35:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:13,654 INFO L225 Difference]: With dead ends: 5643 [2021-11-06 21:35:13,654 INFO L226 Difference]: Without dead ends: 5639 [2021-11-06 21:35:13,656 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2021-11-06 21:35:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5639. [2021-11-06 21:35:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5639 states, 5511 states have (on average 1.3373253493013972) internal successors, (7370), 5638 states have internal predecessors, (7370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5639 states to 5639 states and 7370 transitions. [2021-11-06 21:35:13,857 INFO L78 Accepts]: Start accepts. Automaton has 5639 states and 7370 transitions. Word has length 51 [2021-11-06 21:35:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:13,857 INFO L470 AbstractCegarLoop]: Abstraction has 5639 states and 7370 transitions. [2021-11-06 21:35:13,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7370 transitions. [2021-11-06 21:35:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 21:35:13,858 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:13,859 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] [2021-11-06 21:35:13,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:35:13,859 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash 866967575, now seen corresponding path program 1 times [2021-11-06 21:35:13,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:13,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402294799] [2021-11-06 21:35:13,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:13,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:14,054 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 21:35:14,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:14,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402294799] [2021-11-06 21:35:14,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402294799] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:14,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:14,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:14,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343999268] [2021-11-06 21:35:14,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:14,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:14,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:14,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:14,058 INFO L87 Difference]: Start difference. First operand 5639 states and 7370 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:14,335 INFO L93 Difference]: Finished difference Result 5639 states and 7370 transitions. [2021-11-06 21:35:14,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:14,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-06 21:35:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:14,346 INFO L225 Difference]: With dead ends: 5639 [2021-11-06 21:35:14,346 INFO L226 Difference]: Without dead ends: 5635 [2021-11-06 21:35:14,348 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5635 states. [2021-11-06 21:35:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5635 to 5635. [2021-11-06 21:35:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5635 states, 5509 states have (on average 1.3370847703757487) internal successors, (7366), 5634 states have internal predecessors, (7366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 7366 transitions. [2021-11-06 21:35:14,629 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 7366 transitions. Word has length 53 [2021-11-06 21:35:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:14,630 INFO L470 AbstractCegarLoop]: Abstraction has 5635 states and 7366 transitions. [2021-11-06 21:35:14,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 7366 transitions. [2021-11-06 21:35:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 21:35:14,631 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:14,631 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:35:14,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:35:14,631 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -675645703, now seen corresponding path program 1 times [2021-11-06 21:35:14,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:14,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331336540] [2021-11-06 21:35:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:14,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:15,105 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 21:35:15,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:15,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331336540] [2021-11-06 21:35:15,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331336540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:15,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:15,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:35:15,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033074496] [2021-11-06 21:35:15,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:35:15,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:15,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:35:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:35:15,107 INFO L87 Difference]: Start difference. First operand 5635 states and 7366 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 21:35:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:15,728 INFO L93 Difference]: Finished difference Result 12958 states and 16913 transitions. [2021-11-06 21:35:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:35:15,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 21:35:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:15,747 INFO L225 Difference]: With dead ends: 12958 [2021-11-06 21:35:15,747 INFO L226 Difference]: Without dead ends: 7376 [2021-11-06 21:35:15,760 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:35:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2021-11-06 21:35:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 5635. [2021-11-06 21:35:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5635 states, 5509 states have (on average 1.3316391359593394) internal successors, (7336), 5634 states have internal predecessors, (7336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 7336 transitions. [2021-11-06 21:35:16,027 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 7336 transitions. Word has length 54 [2021-11-06 21:35:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:16,027 INFO L470 AbstractCegarLoop]: Abstraction has 5635 states and 7336 transitions. [2021-11-06 21:35:16,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 21:35:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 7336 transitions. [2021-11-06 21:35:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 21:35:16,028 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:16,028 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 21:35:16,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:35:16,029 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash -675586121, now seen corresponding path program 1 times [2021-11-06 21:35:16,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:16,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128080708] [2021-11-06 21:35:16,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:16,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:16,227 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 21:35:16,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:16,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128080708] [2021-11-06 21:35:16,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128080708] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:16,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:16,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:35:16,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071127748] [2021-11-06 21:35:16,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:16,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:16,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:16,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:16,228 INFO L87 Difference]: Start difference. First operand 5635 states and 7336 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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 21:35:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:16,849 INFO L93 Difference]: Finished difference Result 7376 states and 9575 transitions. [2021-11-06 21:35:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:35:16,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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 21:35:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:16,865 INFO L225 Difference]: With dead ends: 7376 [2021-11-06 21:35:16,865 INFO L226 Difference]: Without dead ends: 7338 [2021-11-06 21:35:16,868 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 21:35:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2021-11-06 21:35:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 5597. [2021-11-06 21:35:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5490 states have (on average 1.3273224043715848) internal successors, (7287), 5596 states have internal predecessors, (7287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 7287 transitions. [2021-11-06 21:35:17,134 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 7287 transitions. Word has length 54 [2021-11-06 21:35:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:17,134 INFO L470 AbstractCegarLoop]: Abstraction has 5597 states and 7287 transitions. [2021-11-06 21:35:17,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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 21:35:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 7287 transitions. [2021-11-06 21:35:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 21:35:17,135 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:17,135 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 21:35:17,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:35:17,136 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:17,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash -67542309, now seen corresponding path program 1 times [2021-11-06 21:35:17,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:17,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569448399] [2021-11-06 21:35:17,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:17,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:17,343 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 21:35:17,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:17,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569448399] [2021-11-06 21:35:17,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569448399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:17,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:17,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:17,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339764568] [2021-11-06 21:35:17,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:17,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:17,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:17,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:17,345 INFO L87 Difference]: Start difference. First operand 5597 states and 7287 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 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 21:35:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:17,616 INFO L93 Difference]: Finished difference Result 5597 states and 7287 transitions. [2021-11-06 21:35:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:17,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 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 21:35:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:17,629 INFO L225 Difference]: With dead ends: 5597 [2021-11-06 21:35:17,630 INFO L226 Difference]: Without dead ends: 5593 [2021-11-06 21:35:17,633 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5593 states. [2021-11-06 21:35:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5593 to 5593. [2021-11-06 21:35:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5593 states, 5488 states have (on average 1.3270772594752187) internal successors, (7283), 5592 states have internal predecessors, (7283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 7283 transitions. [2021-11-06 21:35:17,957 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 7283 transitions. Word has length 55 [2021-11-06 21:35:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:17,958 INFO L470 AbstractCegarLoop]: Abstraction has 5593 states and 7283 transitions. [2021-11-06 21:35:17,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 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 21:35:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 7283 transitions. [2021-11-06 21:35:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:35:17,963 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:17,963 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:35:17,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:35:17,963 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash -483375617, now seen corresponding path program 1 times [2021-11-06 21:35:17,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:17,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949416160] [2021-11-06 21:35:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:17,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:18,174 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 21:35:18,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:18,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949416160] [2021-11-06 21:35:18,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949416160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:18,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:18,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:18,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430814176] [2021-11-06 21:35:18,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:18,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:18,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:18,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:18,176 INFO L87 Difference]: Start difference. First operand 5593 states and 7283 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:18,476 INFO L93 Difference]: Finished difference Result 5593 states and 7283 transitions. [2021-11-06 21:35:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:18,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-11-06 21:35:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:18,488 INFO L225 Difference]: With dead ends: 5593 [2021-11-06 21:35:18,488 INFO L226 Difference]: Without dead ends: 5589 [2021-11-06 21:35:18,490 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2021-11-06 21:35:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 5589. [2021-11-06 21:35:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5589 states, 5486 states have (on average 1.3268319358366751) internal successors, (7279), 5588 states have internal predecessors, (7279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 7279 transitions. [2021-11-06 21:35:18,775 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 7279 transitions. Word has length 57 [2021-11-06 21:35:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:18,776 INFO L470 AbstractCegarLoop]: Abstraction has 5589 states and 7279 transitions. [2021-11-06 21:35:18,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 7279 transitions. [2021-11-06 21:35:18,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:35:18,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:18,777 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] [2021-11-06 21:35:18,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:35:18,777 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:18,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:18,778 INFO L85 PathProgramCache]: Analyzing trace with hash -165297218, now seen corresponding path program 1 times [2021-11-06 21:35:18,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:18,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683072585] [2021-11-06 21:35:18,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:18,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:18,965 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 21:35:18,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:18,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683072585] [2021-11-06 21:35:18,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683072585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:18,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:18,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:35:18,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057258674] [2021-11-06 21:35:18,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:35:18,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:35:18,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:35:18,968 INFO L87 Difference]: Start difference. First operand 5589 states and 7279 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:19,388 INFO L93 Difference]: Finished difference Result 11053 states and 14417 transitions. [2021-11-06 21:35:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:35:19,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-11-06 21:35:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:19,400 INFO L225 Difference]: With dead ends: 11053 [2021-11-06 21:35:19,400 INFO L226 Difference]: Without dead ends: 5521 [2021-11-06 21:35:19,409 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 21:35:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2021-11-06 21:35:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 5521. [2021-11-06 21:35:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5521 states, 5437 states have (on average 1.3187419532830604) internal successors, (7170), 5520 states have internal predecessors, (7170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5521 states to 5521 states and 7170 transitions. [2021-11-06 21:35:19,679 INFO L78 Accepts]: Start accepts. Automaton has 5521 states and 7170 transitions. Word has length 57 [2021-11-06 21:35:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:19,679 INFO L470 AbstractCegarLoop]: Abstraction has 5521 states and 7170 transitions. [2021-11-06 21:35:19,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5521 states and 7170 transitions. [2021-11-06 21:35:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 21:35:19,680 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:19,680 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:35:19,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:35:19,681 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash -667225725, now seen corresponding path program 1 times [2021-11-06 21:35:19,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:19,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803099288] [2021-11-06 21:35:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:19,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:35:19,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:19,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803099288] [2021-11-06 21:35:19,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803099288] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:19,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:19,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:19,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280120657] [2021-11-06 21:35:19,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:19,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:19,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:19,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:19,954 INFO L87 Difference]: Start difference. First operand 5521 states and 7170 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 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 21:35:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:20,265 INFO L93 Difference]: Finished difference Result 5521 states and 7170 transitions. [2021-11-06 21:35:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 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 21:35:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:20,277 INFO L225 Difference]: With dead ends: 5521 [2021-11-06 21:35:20,277 INFO L226 Difference]: Without dead ends: 5517 [2021-11-06 21:35:20,279 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5517 states. [2021-11-06 21:35:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5517 to 5517. [2021-11-06 21:35:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5517 states, 5435 states have (on average 1.318491260349586) internal successors, (7166), 5516 states have internal predecessors, (7166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 7166 transitions. [2021-11-06 21:35:20,737 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 7166 transitions. Word has length 59 [2021-11-06 21:35:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:20,737 INFO L470 AbstractCegarLoop]: Abstraction has 5517 states and 7166 transitions. [2021-11-06 21:35:20,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 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 21:35:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 7166 transitions. [2021-11-06 21:35:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 21:35:20,739 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:20,739 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 21:35:20,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:35:20,739 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1350372906, now seen corresponding path program 1 times [2021-11-06 21:35:20,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:20,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041919851] [2021-11-06 21:35:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:20,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:21,031 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 21:35:21,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:21,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041919851] [2021-11-06 21:35:21,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041919851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:21,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:21,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:21,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826883550] [2021-11-06 21:35:21,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:21,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:21,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:21,034 INFO L87 Difference]: Start difference. First operand 5517 states and 7166 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 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 21:35:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:21,978 INFO L93 Difference]: Finished difference Result 8261 states and 10575 transitions. [2021-11-06 21:35:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:35:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 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 21:35:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:22,004 INFO L225 Difference]: With dead ends: 8261 [2021-11-06 21:35:22,004 INFO L226 Difference]: Without dead ends: 8233 [2021-11-06 21:35:22,009 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8233 states. [2021-11-06 21:35:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8233 to 6021. [2021-11-06 21:35:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6021 states, 5941 states have (on average 1.300454468944622) internal successors, (7726), 6020 states have internal predecessors, (7726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6021 states to 6021 states and 7726 transitions. [2021-11-06 21:35:22,477 INFO L78 Accepts]: Start accepts. Automaton has 6021 states and 7726 transitions. Word has length 59 [2021-11-06 21:35:22,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:22,477 INFO L470 AbstractCegarLoop]: Abstraction has 6021 states and 7726 transitions. [2021-11-06 21:35:22,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 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 21:35:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 6021 states and 7726 transitions. [2021-11-06 21:35:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 21:35:22,478 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:22,479 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] [2021-11-06 21:35:22,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:35:22,479 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1253520025, now seen corresponding path program 1 times [2021-11-06 21:35:22,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:22,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122154351] [2021-11-06 21:35:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:22,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:22,676 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 21:35:22,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:22,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122154351] [2021-11-06 21:35:22,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122154351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:22,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:22,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:22,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304053699] [2021-11-06 21:35:22,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:22,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:22,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:22,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:22,677 INFO L87 Difference]: Start difference. First operand 6021 states and 7726 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:23,059 INFO L93 Difference]: Finished difference Result 6021 states and 7726 transitions. [2021-11-06 21:35:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:23,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-11-06 21:35:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:23,071 INFO L225 Difference]: With dead ends: 6021 [2021-11-06 21:35:23,072 INFO L226 Difference]: Without dead ends: 6017 [2021-11-06 21:35:23,074 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2021-11-06 21:35:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 6017. [2021-11-06 21:35:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6017 states, 5939 states have (on average 1.300218892069372) internal successors, (7722), 6016 states have internal predecessors, (7722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6017 states to 6017 states and 7722 transitions. [2021-11-06 21:35:23,376 INFO L78 Accepts]: Start accepts. Automaton has 6017 states and 7722 transitions. Word has length 61 [2021-11-06 21:35:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:23,377 INFO L470 AbstractCegarLoop]: Abstraction has 6017 states and 7722 transitions. [2021-11-06 21:35:23,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6017 states and 7722 transitions. [2021-11-06 21:35:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 21:35:23,378 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:23,378 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:35:23,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:35:23,378 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:23,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2041626197, now seen corresponding path program 1 times [2021-11-06 21:35:23,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:23,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854722887] [2021-11-06 21:35:23,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:23,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:23,548 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 21:35:23,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:23,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854722887] [2021-11-06 21:35:23,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854722887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:23,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:23,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:23,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900342579] [2021-11-06 21:35:23,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:23,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:23,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:23,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:23,551 INFO L87 Difference]: Start difference. First operand 6017 states and 7722 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:24,011 INFO L93 Difference]: Finished difference Result 6017 states and 7722 transitions. [2021-11-06 21:35:24,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:24,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-06 21:35:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:24,024 INFO L225 Difference]: With dead ends: 6017 [2021-11-06 21:35:24,024 INFO L226 Difference]: Without dead ends: 6013 [2021-11-06 21:35:24,026 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2021-11-06 21:35:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 6013. [2021-11-06 21:35:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6013 states, 5937 states have (on average 1.299983156476335) internal successors, (7718), 6012 states have internal predecessors, (7718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6013 states to 6013 states and 7718 transitions. [2021-11-06 21:35:24,417 INFO L78 Accepts]: Start accepts. Automaton has 6013 states and 7718 transitions. Word has length 63 [2021-11-06 21:35:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:24,418 INFO L470 AbstractCegarLoop]: Abstraction has 6013 states and 7718 transitions. [2021-11-06 21:35:24,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6013 states and 7718 transitions. [2021-11-06 21:35:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 21:35:24,419 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:24,419 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] [2021-11-06 21:35:24,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:35:24,420 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:24,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:24,420 INFO L85 PathProgramCache]: Analyzing trace with hash 797554255, now seen corresponding path program 1 times [2021-11-06 21:35:24,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:24,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092988897] [2021-11-06 21:35:24,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:24,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:24,598 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 21:35:24,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:24,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092988897] [2021-11-06 21:35:24,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092988897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:24,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:24,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:24,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140913976] [2021-11-06 21:35:24,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:24,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:24,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:24,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:24,602 INFO L87 Difference]: Start difference. First operand 6013 states and 7718 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:25,491 INFO L93 Difference]: Finished difference Result 11887 states and 15269 transitions. [2021-11-06 21:35:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:35:25,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-11-06 21:35:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:25,517 INFO L225 Difference]: With dead ends: 11887 [2021-11-06 21:35:25,517 INFO L226 Difference]: Without dead ends: 11883 [2021-11-06 21:35:25,522 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2021-11-06 21:35:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 11711. [2021-11-06 21:35:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11711 states, 11635 states have (on average 1.3027073485174043) internal successors, (15157), 11710 states have internal predecessors, (15157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11711 states to 11711 states and 15157 transitions. [2021-11-06 21:35:26,192 INFO L78 Accepts]: Start accepts. Automaton has 11711 states and 15157 transitions. Word has length 65 [2021-11-06 21:35:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:26,192 INFO L470 AbstractCegarLoop]: Abstraction has 11711 states and 15157 transitions. [2021-11-06 21:35:26,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 11711 states and 15157 transitions. [2021-11-06 21:35:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:35:26,194 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:26,194 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] [2021-11-06 21:35:26,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:35:26,194 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1945736019, now seen corresponding path program 1 times [2021-11-06 21:35:26,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:26,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769519692] [2021-11-06 21:35:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:26,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:26,376 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 21:35:26,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:26,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769519692] [2021-11-06 21:35:26,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769519692] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:26,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:26,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:26,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825609921] [2021-11-06 21:35:26,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:26,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:26,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:26,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:26,379 INFO L87 Difference]: Start difference. First operand 11711 states and 15157 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:27,371 INFO L93 Difference]: Finished difference Result 11711 states and 15157 transitions. [2021-11-06 21:35:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:27,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-11-06 21:35:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:27,400 INFO L225 Difference]: With dead ends: 11711 [2021-11-06 21:35:27,400 INFO L226 Difference]: Without dead ends: 11707 [2021-11-06 21:35:27,407 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11707 states. [2021-11-06 21:35:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11707 to 11707. [2021-11-06 21:35:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11707 states, 11633 states have (on average 1.30258746668959) internal successors, (15153), 11706 states have internal predecessors, (15153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11707 states to 11707 states and 15153 transitions. [2021-11-06 21:35:28,076 INFO L78 Accepts]: Start accepts. Automaton has 11707 states and 15153 transitions. Word has length 67 [2021-11-06 21:35:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:28,077 INFO L470 AbstractCegarLoop]: Abstraction has 11707 states and 15153 transitions. [2021-11-06 21:35:28,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11707 states and 15153 transitions. [2021-11-06 21:35:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 21:35:28,083 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:28,083 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] [2021-11-06 21:35:28,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 21:35:28,084 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1541816503, now seen corresponding path program 1 times [2021-11-06 21:35:28,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:28,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554028784] [2021-11-06 21:35:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:28,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:28,328 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 21:35:28,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:28,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554028784] [2021-11-06 21:35:28,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554028784] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:28,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:28,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:28,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419526866] [2021-11-06 21:35:28,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:28,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:28,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:28,331 INFO L87 Difference]: Start difference. First operand 11707 states and 15153 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:29,602 INFO L93 Difference]: Finished difference Result 23231 states and 30089 transitions. [2021-11-06 21:35:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:29,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-11-06 21:35:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:29,729 INFO L225 Difference]: With dead ends: 23231 [2021-11-06 21:35:29,729 INFO L226 Difference]: Without dead ends: 23123 [2021-11-06 21:35:29,737 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 21:35:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23123 states. [2021-11-06 21:35:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23123 to 22951. [2021-11-06 21:35:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22951 states, 22877 states have (on average 1.305109935743323) internal successors, (29857), 22950 states have internal predecessors, (29857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22951 states to 22951 states and 29857 transitions. [2021-11-06 21:35:30,964 INFO L78 Accepts]: Start accepts. Automaton has 22951 states and 29857 transitions. Word has length 69 [2021-11-06 21:35:30,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:30,965 INFO L470 AbstractCegarLoop]: Abstraction has 22951 states and 29857 transitions. [2021-11-06 21:35:30,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 22951 states and 29857 transitions. [2021-11-06 21:35:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 21:35:30,966 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:30,966 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] [2021-11-06 21:35:30,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 21:35:30,971 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1085936825, now seen corresponding path program 1 times [2021-11-06 21:35:30,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:30,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147095153] [2021-11-06 21:35:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:30,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:31,167 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 21:35:31,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:31,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147095153] [2021-11-06 21:35:31,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147095153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:31,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:31,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:35:31,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039839022] [2021-11-06 21:35:31,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:35:31,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:35:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:35:31,169 INFO L87 Difference]: Start difference. First operand 22951 states and 29857 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:32,607 INFO L93 Difference]: Finished difference Result 40653 states and 52816 transitions. [2021-11-06 21:35:32,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:35:32,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-11-06 21:35:32,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:32,641 INFO L225 Difference]: With dead ends: 40653 [2021-11-06 21:35:32,641 INFO L226 Difference]: Without dead ends: 22941 [2021-11-06 21:35:32,670 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 21:35:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22941 states. [2021-11-06 21:35:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22941 to 22941. [2021-11-06 21:35:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22941 states, 22868 states have (on average 1.3045303480846597) internal successors, (29832), 22940 states have internal predecessors, (29832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22941 states to 22941 states and 29832 transitions. [2021-11-06 21:35:34,243 INFO L78 Accepts]: Start accepts. Automaton has 22941 states and 29832 transitions. Word has length 69 [2021-11-06 21:35:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:34,243 INFO L470 AbstractCegarLoop]: Abstraction has 22941 states and 29832 transitions. [2021-11-06 21:35:34,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 22941 states and 29832 transitions. [2021-11-06 21:35:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 21:35:34,244 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:34,244 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] [2021-11-06 21:35:34,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 21:35:34,244 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1122754874, now seen corresponding path program 1 times [2021-11-06 21:35:34,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:34,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177173781] [2021-11-06 21:35:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:34,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:34,463 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 21:35:34,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:34,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177173781] [2021-11-06 21:35:34,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177173781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:34,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:34,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:35:34,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694817072] [2021-11-06 21:35:34,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:35:34,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:34,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:35:34,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:35:34,465 INFO L87 Difference]: Start difference. First operand 22941 states and 29832 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:35,924 INFO L93 Difference]: Finished difference Result 40656 states and 52792 transitions. [2021-11-06 21:35:35,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:35:35,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-11-06 21:35:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:35,961 INFO L225 Difference]: With dead ends: 40656 [2021-11-06 21:35:35,961 INFO L226 Difference]: Without dead ends: 22978 [2021-11-06 21:35:35,983 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:35:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22978 states. [2021-11-06 21:35:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22978 to 22931. [2021-11-06 21:35:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22931 states, 22859 states have (on average 1.3039503040377969) internal successors, (29807), 22930 states have internal predecessors, (29807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22931 states to 22931 states and 29807 transitions. [2021-11-06 21:35:37,097 INFO L78 Accepts]: Start accepts. Automaton has 22931 states and 29807 transitions. Word has length 72 [2021-11-06 21:35:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:37,098 INFO L470 AbstractCegarLoop]: Abstraction has 22931 states and 29807 transitions. [2021-11-06 21:35:37,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 22931 states and 29807 transitions. [2021-11-06 21:35:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-06 21:35:37,100 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:37,100 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 21:35:37,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 21:35:37,100 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 533289107, now seen corresponding path program 1 times [2021-11-06 21:35:37,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:37,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071574181] [2021-11-06 21:35:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:37,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:37,315 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 21:35:37,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:37,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071574181] [2021-11-06 21:35:37,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071574181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:37,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:37,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:35:37,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863277784] [2021-11-06 21:35:37,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:37,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:37,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:37,317 INFO L87 Difference]: Start difference. First operand 22931 states and 29807 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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 21:35:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:45,021 INFO L93 Difference]: Finished difference Result 99963 states and 129091 transitions. [2021-11-06 21:35:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:35:45,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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 21:35:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:45,156 INFO L225 Difference]: With dead ends: 99963 [2021-11-06 21:35:45,157 INFO L226 Difference]: Without dead ends: 78633 [2021-11-06 21:35:45,201 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 21:35:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78633 states. [2021-11-06 21:35:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78633 to 23731. [2021-11-06 21:35:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23731 states, 23659 states have (on average 1.293672598165603) internal successors, (30607), 23730 states have internal predecessors, (30607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23731 states to 23731 states and 30607 transitions. [2021-11-06 21:35:47,228 INFO L78 Accepts]: Start accepts. Automaton has 23731 states and 30607 transitions. Word has length 83 [2021-11-06 21:35:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:47,228 INFO L470 AbstractCegarLoop]: Abstraction has 23731 states and 30607 transitions. [2021-11-06 21:35:47,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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 21:35:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 23731 states and 30607 transitions. [2021-11-06 21:35:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 21:35:47,230 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:47,230 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 21:35:47,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 21:35:47,231 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:47,231 INFO L85 PathProgramCache]: Analyzing trace with hash -999302728, now seen corresponding path program 1 times [2021-11-06 21:35:47,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:47,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894238396] [2021-11-06 21:35:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:47,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:47,422 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 21:35:47,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:47,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894238396] [2021-11-06 21:35:47,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894238396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:47,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:47,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:35:47,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130834823] [2021-11-06 21:35:47,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:47,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:47,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:47,424 INFO L87 Difference]: Start difference. First operand 23731 states and 30607 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 21:35:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:35:53,096 INFO L93 Difference]: Finished difference Result 65727 states and 84297 transitions. [2021-11-06 21:35:53,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:35:53,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 21:35:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:35:53,161 INFO L225 Difference]: With dead ends: 65727 [2021-11-06 21:35:53,162 INFO L226 Difference]: Without dead ends: 43533 [2021-11-06 21:35:53,188 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 21:35:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43533 states. [2021-11-06 21:35:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43533 to 26331. [2021-11-06 21:35:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26331 states, 26259 states have (on average 1.295060741079249) internal successors, (34007), 26330 states have internal predecessors, (34007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:35:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26331 states to 26331 states and 34007 transitions. [2021-11-06 21:35:55,292 INFO L78 Accepts]: Start accepts. Automaton has 26331 states and 34007 transitions. Word has length 84 [2021-11-06 21:35:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:35:55,292 INFO L470 AbstractCegarLoop]: Abstraction has 26331 states and 34007 transitions. [2021-11-06 21:35:55,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 21:35:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 26331 states and 34007 transitions. [2021-11-06 21:35:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 21:35:55,294 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:35:55,295 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 21:35:55,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 21:35:55,295 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:35:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:35:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash -741137290, now seen corresponding path program 1 times [2021-11-06 21:35:55,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:35:55,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807822875] [2021-11-06 21:35:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:35:55,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:35:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:35:55,506 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 21:35:55,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:35:55,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807822875] [2021-11-06 21:35:55,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807822875] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:35:55,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:35:55,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:35:55,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80098126] [2021-11-06 21:35:55,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:35:55,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:35:55,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:35:55,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:35:55,507 INFO L87 Difference]: Start difference. First operand 26331 states and 34007 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 21:36:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:02,694 INFO L93 Difference]: Finished difference Result 63140 states and 80069 transitions. [2021-11-06 21:36:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:02,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 21:36:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:02,789 INFO L225 Difference]: With dead ends: 63140 [2021-11-06 21:36:02,789 INFO L226 Difference]: Without dead ends: 63090 [2021-11-06 21:36:02,809 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 21:36:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63090 states. [2021-11-06 21:36:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63090 to 26281. [2021-11-06 21:36:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26281 states, 26234 states have (on average 1.2877182282534116) internal successors, (33782), 26280 states have internal predecessors, (33782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26281 states to 26281 states and 33782 transitions. [2021-11-06 21:36:04,976 INFO L78 Accepts]: Start accepts. Automaton has 26281 states and 33782 transitions. Word has length 84 [2021-11-06 21:36:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:04,976 INFO L470 AbstractCegarLoop]: Abstraction has 26281 states and 33782 transitions. [2021-11-06 21:36:04,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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 21:36:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26281 states and 33782 transitions. [2021-11-06 21:36:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 21:36:04,978 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:04,978 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 21:36:04,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 21:36:04,978 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 147 more)] === [2021-11-06 21:36:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1521367575, now seen corresponding path program 1 times [2021-11-06 21:36:04,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:04,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630316298] [2021-11-06 21:36:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:04,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:05,182 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 21:36:05,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:05,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630316298] [2021-11-06 21:36:05,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630316298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:05,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:05,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:36:05,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268733691] [2021-11-06 21:36:05,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:36:05,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:05,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:36:05,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:05,184 INFO L87 Difference]: Start difference. First operand 26281 states and 33782 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 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)