./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--usb--misc--yurex.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--usb--misc--yurex.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 1df63cbd0336246e03c8a08fdd7cd62b20ae4ea405c1b7aaed1bb78f9f0fa189 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 22:04:20,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 22:04:20,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 22:04:20,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 22:04:20,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 22:04:20,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 22:04:20,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 22:04:20,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 22:04:20,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 22:04:20,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 22:04:20,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 22:04:20,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 22:04:20,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 22:04:20,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 22:04:20,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 22:04:20,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 22:04:20,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 22:04:20,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 22:04:20,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 22:04:20,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 22:04:20,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 22:04:20,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 22:04:20,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 22:04:20,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 22:04:20,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 22:04:20,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 22:04:20,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 22:04:20,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 22:04:20,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 22:04:20,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 22:04:20,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 22:04:20,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 22:04:20,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 22:04:20,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 22:04:20,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 22:04:20,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 22:04:20,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 22:04:20,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 22:04:20,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 22:04:20,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 22:04:20,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 22:04:20,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 22:04:20,805 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 22:04:20,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 22:04:20,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 22:04:20,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 22:04:20,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 22:04:20,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 22:04:20,807 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 22:04:20,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 22:04:20,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 22:04:20,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 22:04:20,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 22:04:20,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 22:04:20,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 22:04:20,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 22:04:20,809 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 22:04:20,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 22:04:20,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 22:04:20,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 22:04:20,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 22:04:20,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 22:04:20,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 22:04:20,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 22:04:20,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 22:04:20,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 22:04:20,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 22:04:20,811 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 22:04:20,811 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 22:04:20,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 22:04:20,812 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 22:04:20,812 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 -> 1df63cbd0336246e03c8a08fdd7cd62b20ae4ea405c1b7aaed1bb78f9f0fa189 [2021-11-06 22:04:21,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 22:04:21,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 22:04:21,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 22:04:21,075 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 22:04:21,076 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 22:04:21,076 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--usb--misc--yurex.ko.cil.i [2021-11-06 22:04:21,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07eb49c38/e05e65b83b9541b4b9904bc90ec44d66/FLAG5dabebcab [2021-11-06 22:04:21,716 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 22:04:21,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2021-11-06 22:04:21,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07eb49c38/e05e65b83b9541b4b9904bc90ec44d66/FLAG5dabebcab [2021-11-06 22:04:21,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07eb49c38/e05e65b83b9541b4b9904bc90ec44d66 [2021-11-06 22:04:21,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 22:04:21,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 22:04:21,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 22:04:21,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 22:04:21,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 22:04:21,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:21" (1/1) ... [2021-11-06 22:04:21,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51889d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:21, skipping insertion in model container [2021-11-06 22:04:21,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:21" (1/1) ... [2021-11-06 22:04:21,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 22:04:22,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 22:04:23,235 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--usb--misc--yurex.ko.cil.i[259112,259125] [2021-11-06 22:04:23,237 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--usb--misc--yurex.ko.cil.i[259257,259270] [2021-11-06 22:04:23,237 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--usb--misc--yurex.ko.cil.i[259403,259416] [2021-11-06 22:04:23,238 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--usb--misc--yurex.ko.cil.i[259568,259581] [2021-11-06 22:04:23,238 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--usb--misc--yurex.ko.cil.i[259726,259739] [2021-11-06 22:04:23,239 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--usb--misc--yurex.ko.cil.i[259884,259897] [2021-11-06 22:04:23,239 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--usb--misc--yurex.ko.cil.i[260042,260055] [2021-11-06 22:04:23,240 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--usb--misc--yurex.ko.cil.i[260202,260215] [2021-11-06 22:04:23,240 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--usb--misc--yurex.ko.cil.i[260361,260374] [2021-11-06 22:04:23,240 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--usb--misc--yurex.ko.cil.i[260500,260513] [2021-11-06 22:04:23,241 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--usb--misc--yurex.ko.cil.i[260642,260655] [2021-11-06 22:04:23,242 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--usb--misc--yurex.ko.cil.i[260791,260804] [2021-11-06 22:04:23,242 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--usb--misc--yurex.ko.cil.i[260930,260943] [2021-11-06 22:04:23,242 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--usb--misc--yurex.ko.cil.i[261085,261098] [2021-11-06 22:04:23,242 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--usb--misc--yurex.ko.cil.i[261245,261258] [2021-11-06 22:04:23,243 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--usb--misc--yurex.ko.cil.i[261396,261409] [2021-11-06 22:04:23,243 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--usb--misc--yurex.ko.cil.i[261547,261560] [2021-11-06 22:04:23,243 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--usb--misc--yurex.ko.cil.i[261699,261712] [2021-11-06 22:04:23,244 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--usb--misc--yurex.ko.cil.i[261848,261861] [2021-11-06 22:04:23,244 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--usb--misc--yurex.ko.cil.i[261996,262009] [2021-11-06 22:04:23,245 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--usb--misc--yurex.ko.cil.i[262153,262166] [2021-11-06 22:04:23,245 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--usb--misc--yurex.ko.cil.i[262302,262315] [2021-11-06 22:04:23,245 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--usb--misc--yurex.ko.cil.i[262458,262471] [2021-11-06 22:04:23,246 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--usb--misc--yurex.ko.cil.i[262611,262624] [2021-11-06 22:04:23,246 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--usb--misc--yurex.ko.cil.i[262757,262770] [2021-11-06 22:04:23,247 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--usb--misc--yurex.ko.cil.i[262900,262913] [2021-11-06 22:04:23,252 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--usb--misc--yurex.ko.cil.i[263052,263065] [2021-11-06 22:04:23,252 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--usb--misc--yurex.ko.cil.i[263198,263211] [2021-11-06 22:04:23,253 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--usb--misc--yurex.ko.cil.i[263343,263356] [2021-11-06 22:04:23,253 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--usb--misc--yurex.ko.cil.i[263497,263510] [2021-11-06 22:04:23,254 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--usb--misc--yurex.ko.cil.i[263648,263661] [2021-11-06 22:04:23,254 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--usb--misc--yurex.ko.cil.i[263803,263816] [2021-11-06 22:04:23,255 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--usb--misc--yurex.ko.cil.i[263955,263968] [2021-11-06 22:04:23,255 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--usb--misc--yurex.ko.cil.i[264110,264123] [2021-11-06 22:04:23,255 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--usb--misc--yurex.ko.cil.i[264274,264287] [2021-11-06 22:04:23,256 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--usb--misc--yurex.ko.cil.i[264430,264443] [2021-11-06 22:04:23,256 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--usb--misc--yurex.ko.cil.i[264594,264607] [2021-11-06 22:04:23,257 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--usb--misc--yurex.ko.cil.i[264736,264749] [2021-11-06 22:04:23,257 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--usb--misc--yurex.ko.cil.i[264894,264907] [2021-11-06 22:04:23,257 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--usb--misc--yurex.ko.cil.i[265061,265074] [2021-11-06 22:04:23,326 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--usb--misc--yurex.ko.cil.i[265220,265233] [2021-11-06 22:04:23,326 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--usb--misc--yurex.ko.cil.i[265379,265392] [2021-11-06 22:04:23,326 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--usb--misc--yurex.ko.cil.i[265528,265541] [2021-11-06 22:04:23,326 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--usb--misc--yurex.ko.cil.i[265675,265688] [2021-11-06 22:04:23,327 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--usb--misc--yurex.ko.cil.i[265814,265827] [2021-11-06 22:04:23,327 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--usb--misc--yurex.ko.cil.i[265977,265990] [2021-11-06 22:04:23,327 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--usb--misc--yurex.ko.cil.i[266143,266156] [2021-11-06 22:04:23,327 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--usb--misc--yurex.ko.cil.i[266307,266320] [2021-11-06 22:04:23,327 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--usb--misc--yurex.ko.cil.i[266472,266485] [2021-11-06 22:04:23,328 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--usb--misc--yurex.ko.cil.i[266637,266650] [2021-11-06 22:04:23,328 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--usb--misc--yurex.ko.cil.i[266803,266816] [2021-11-06 22:04:23,328 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--usb--misc--yurex.ko.cil.i[266968,266981] [2021-11-06 22:04:23,328 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--usb--misc--yurex.ko.cil.i[267135,267148] [2021-11-06 22:04:23,329 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--usb--misc--yurex.ko.cil.i[267295,267308] [2021-11-06 22:04:23,329 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--usb--misc--yurex.ko.cil.i[267457,267470] [2021-11-06 22:04:23,329 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--usb--misc--yurex.ko.cil.i[267616,267629] [2021-11-06 22:04:23,329 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--usb--misc--yurex.ko.cil.i[267762,267775] [2021-11-06 22:04:23,329 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--usb--misc--yurex.ko.cil.i[267905,267918] [2021-11-06 22:04:23,330 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--usb--misc--yurex.ko.cil.i[268049,268062] [2021-11-06 22:04:23,330 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--usb--misc--yurex.ko.cil.i[268192,268205] [2021-11-06 22:04:23,330 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--usb--misc--yurex.ko.cil.i[268336,268349] [2021-11-06 22:04:23,330 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--usb--misc--yurex.ko.cil.i[268477,268490] [2021-11-06 22:04:23,331 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--usb--misc--yurex.ko.cil.i[268615,268628] [2021-11-06 22:04:23,331 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--usb--misc--yurex.ko.cil.i[268773,268786] [2021-11-06 22:04:23,336 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--usb--misc--yurex.ko.cil.i[268932,268945] [2021-11-06 22:04:23,337 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--usb--misc--yurex.ko.cil.i[269088,269101] [2021-11-06 22:04:23,337 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--usb--misc--yurex.ko.cil.i[269237,269250] [2021-11-06 22:04:23,337 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--usb--misc--yurex.ko.cil.i[269389,269402] [2021-11-06 22:04:23,337 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--usb--misc--yurex.ko.cil.i[269540,269553] [2021-11-06 22:04:23,338 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--usb--misc--yurex.ko.cil.i[269689,269702] [2021-11-06 22:04:23,338 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--usb--misc--yurex.ko.cil.i[269841,269854] [2021-11-06 22:04:23,338 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--usb--misc--yurex.ko.cil.i[269989,270002] [2021-11-06 22:04:23,339 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--usb--misc--yurex.ko.cil.i[270142,270155] [2021-11-06 22:04:23,339 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--usb--misc--yurex.ko.cil.i[270293,270306] [2021-11-06 22:04:23,340 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--usb--misc--yurex.ko.cil.i[270443,270456] [2021-11-06 22:04:23,340 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--usb--misc--yurex.ko.cil.i[270590,270603] [2021-11-06 22:04:23,340 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--usb--misc--yurex.ko.cil.i[270741,270754] [2021-11-06 22:04:23,340 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--usb--misc--yurex.ko.cil.i[270892,270905] [2021-11-06 22:04:23,341 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--usb--misc--yurex.ko.cil.i[271040,271053] [2021-11-06 22:04:23,341 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--usb--misc--yurex.ko.cil.i[271206,271219] [2021-11-06 22:04:23,341 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--usb--misc--yurex.ko.cil.i[271375,271388] [2021-11-06 22:04:23,342 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--usb--misc--yurex.ko.cil.i[271542,271555] [2021-11-06 22:04:23,342 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--usb--misc--yurex.ko.cil.i[271710,271723] [2021-11-06 22:04:23,342 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--usb--misc--yurex.ko.cil.i[271860,271873] [2021-11-06 22:04:23,343 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--usb--misc--yurex.ko.cil.i[272007,272020] [2021-11-06 22:04:23,343 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--usb--misc--yurex.ko.cil.i[272168,272181] [2021-11-06 22:04:23,343 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--usb--misc--yurex.ko.cil.i[272338,272351] [2021-11-06 22:04:23,343 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--usb--misc--yurex.ko.cil.i[272500,272513] [2021-11-06 22:04:23,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 22:04:23,416 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 22:04:23,610 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--usb--misc--yurex.ko.cil.i[259112,259125] [2021-11-06 22:04:23,610 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--usb--misc--yurex.ko.cil.i[259257,259270] [2021-11-06 22:04:23,611 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--usb--misc--yurex.ko.cil.i[259403,259416] [2021-11-06 22:04:23,611 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--usb--misc--yurex.ko.cil.i[259568,259581] [2021-11-06 22:04:23,612 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--usb--misc--yurex.ko.cil.i[259726,259739] [2021-11-06 22:04:23,615 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--usb--misc--yurex.ko.cil.i[259884,259897] [2021-11-06 22:04:23,616 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--usb--misc--yurex.ko.cil.i[260042,260055] [2021-11-06 22:04:23,617 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--usb--misc--yurex.ko.cil.i[260202,260215] [2021-11-06 22:04:23,617 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--usb--misc--yurex.ko.cil.i[260361,260374] [2021-11-06 22:04:23,618 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--usb--misc--yurex.ko.cil.i[260500,260513] [2021-11-06 22:04:23,618 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--usb--misc--yurex.ko.cil.i[260642,260655] [2021-11-06 22:04:23,619 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--usb--misc--yurex.ko.cil.i[260791,260804] [2021-11-06 22:04:23,619 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--usb--misc--yurex.ko.cil.i[260930,260943] [2021-11-06 22:04:23,619 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--usb--misc--yurex.ko.cil.i[261085,261098] [2021-11-06 22:04:23,619 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--usb--misc--yurex.ko.cil.i[261245,261258] [2021-11-06 22:04:23,620 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--usb--misc--yurex.ko.cil.i[261396,261409] [2021-11-06 22:04:23,620 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--usb--misc--yurex.ko.cil.i[261547,261560] [2021-11-06 22:04:23,620 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--usb--misc--yurex.ko.cil.i[261699,261712] [2021-11-06 22:04:23,621 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--usb--misc--yurex.ko.cil.i[261848,261861] [2021-11-06 22:04:23,621 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--usb--misc--yurex.ko.cil.i[261996,262009] [2021-11-06 22:04:23,621 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--usb--misc--yurex.ko.cil.i[262153,262166] [2021-11-06 22:04:23,622 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--usb--misc--yurex.ko.cil.i[262302,262315] [2021-11-06 22:04:23,622 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--usb--misc--yurex.ko.cil.i[262458,262471] [2021-11-06 22:04:23,623 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--usb--misc--yurex.ko.cil.i[262611,262624] [2021-11-06 22:04:23,623 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--usb--misc--yurex.ko.cil.i[262757,262770] [2021-11-06 22:04:23,623 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--usb--misc--yurex.ko.cil.i[262900,262913] [2021-11-06 22:04:23,623 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--usb--misc--yurex.ko.cil.i[263052,263065] [2021-11-06 22:04:23,624 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--usb--misc--yurex.ko.cil.i[263198,263211] [2021-11-06 22:04:23,624 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--usb--misc--yurex.ko.cil.i[263343,263356] [2021-11-06 22:04:23,624 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--usb--misc--yurex.ko.cil.i[263497,263510] [2021-11-06 22:04:23,625 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--usb--misc--yurex.ko.cil.i[263648,263661] [2021-11-06 22:04:23,625 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--usb--misc--yurex.ko.cil.i[263803,263816] [2021-11-06 22:04:23,625 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--usb--misc--yurex.ko.cil.i[263955,263968] [2021-11-06 22:04:23,625 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--usb--misc--yurex.ko.cil.i[264110,264123] [2021-11-06 22:04:23,626 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--usb--misc--yurex.ko.cil.i[264274,264287] [2021-11-06 22:04:23,626 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--usb--misc--yurex.ko.cil.i[264430,264443] [2021-11-06 22:04:23,627 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--usb--misc--yurex.ko.cil.i[264594,264607] [2021-11-06 22:04:23,627 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--usb--misc--yurex.ko.cil.i[264736,264749] [2021-11-06 22:04:23,627 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--usb--misc--yurex.ko.cil.i[264894,264907] [2021-11-06 22:04:23,627 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--usb--misc--yurex.ko.cil.i[265061,265074] [2021-11-06 22:04:23,628 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--usb--misc--yurex.ko.cil.i[265220,265233] [2021-11-06 22:04:23,628 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--usb--misc--yurex.ko.cil.i[265379,265392] [2021-11-06 22:04:23,629 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--usb--misc--yurex.ko.cil.i[265528,265541] [2021-11-06 22:04:23,630 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--usb--misc--yurex.ko.cil.i[265675,265688] [2021-11-06 22:04:23,631 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--usb--misc--yurex.ko.cil.i[265814,265827] [2021-11-06 22:04:23,631 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--usb--misc--yurex.ko.cil.i[265977,265990] [2021-11-06 22:04:23,631 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--usb--misc--yurex.ko.cil.i[266143,266156] [2021-11-06 22:04:23,631 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--usb--misc--yurex.ko.cil.i[266307,266320] [2021-11-06 22:04:23,632 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--usb--misc--yurex.ko.cil.i[266472,266485] [2021-11-06 22:04:23,632 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--usb--misc--yurex.ko.cil.i[266637,266650] [2021-11-06 22:04:23,632 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--usb--misc--yurex.ko.cil.i[266803,266816] [2021-11-06 22:04:23,633 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--usb--misc--yurex.ko.cil.i[266968,266981] [2021-11-06 22:04:23,633 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--usb--misc--yurex.ko.cil.i[267135,267148] [2021-11-06 22:04:23,633 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--usb--misc--yurex.ko.cil.i[267295,267308] [2021-11-06 22:04:23,634 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--usb--misc--yurex.ko.cil.i[267457,267470] [2021-11-06 22:04:23,634 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--usb--misc--yurex.ko.cil.i[267616,267629] [2021-11-06 22:04:23,634 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--usb--misc--yurex.ko.cil.i[267762,267775] [2021-11-06 22:04:23,635 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--usb--misc--yurex.ko.cil.i[267905,267918] [2021-11-06 22:04:23,635 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--usb--misc--yurex.ko.cil.i[268049,268062] [2021-11-06 22:04:23,687 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--usb--misc--yurex.ko.cil.i[268192,268205] [2021-11-06 22:04:23,687 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--usb--misc--yurex.ko.cil.i[268336,268349] [2021-11-06 22:04:23,688 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--usb--misc--yurex.ko.cil.i[268477,268490] [2021-11-06 22:04:23,688 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--usb--misc--yurex.ko.cil.i[268615,268628] [2021-11-06 22:04:23,688 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--usb--misc--yurex.ko.cil.i[268773,268786] [2021-11-06 22:04:23,688 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--usb--misc--yurex.ko.cil.i[268932,268945] [2021-11-06 22:04:23,688 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--usb--misc--yurex.ko.cil.i[269088,269101] [2021-11-06 22:04:23,689 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--usb--misc--yurex.ko.cil.i[269237,269250] [2021-11-06 22:04:23,689 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--usb--misc--yurex.ko.cil.i[269389,269402] [2021-11-06 22:04:23,689 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--usb--misc--yurex.ko.cil.i[269540,269553] [2021-11-06 22:04:23,689 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--usb--misc--yurex.ko.cil.i[269689,269702] [2021-11-06 22:04:23,689 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--usb--misc--yurex.ko.cil.i[269841,269854] [2021-11-06 22:04:23,690 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--usb--misc--yurex.ko.cil.i[269989,270002] [2021-11-06 22:04:23,690 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--usb--misc--yurex.ko.cil.i[270142,270155] [2021-11-06 22:04:23,690 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--usb--misc--yurex.ko.cil.i[270293,270306] [2021-11-06 22:04:23,690 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--usb--misc--yurex.ko.cil.i[270443,270456] [2021-11-06 22:04:23,690 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--usb--misc--yurex.ko.cil.i[270590,270603] [2021-11-06 22:04:23,690 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--usb--misc--yurex.ko.cil.i[270741,270754] [2021-11-06 22:04:23,691 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--usb--misc--yurex.ko.cil.i[270892,270905] [2021-11-06 22:04:23,691 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--usb--misc--yurex.ko.cil.i[271040,271053] [2021-11-06 22:04:23,691 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--usb--misc--yurex.ko.cil.i[271206,271219] [2021-11-06 22:04:23,691 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--usb--misc--yurex.ko.cil.i[271375,271388] [2021-11-06 22:04:23,691 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--usb--misc--yurex.ko.cil.i[271542,271555] [2021-11-06 22:04:23,692 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--usb--misc--yurex.ko.cil.i[271710,271723] [2021-11-06 22:04:23,692 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--usb--misc--yurex.ko.cil.i[271860,271873] [2021-11-06 22:04:23,692 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--usb--misc--yurex.ko.cil.i[272007,272020] [2021-11-06 22:04:23,692 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--usb--misc--yurex.ko.cil.i[272168,272181] [2021-11-06 22:04:23,692 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--usb--misc--yurex.ko.cil.i[272338,272351] [2021-11-06 22:04:23,693 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--usb--misc--yurex.ko.cil.i[272500,272513] [2021-11-06 22:04:23,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 22:04:23,787 INFO L208 MainTranslator]: Completed translation [2021-11-06 22:04:23,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23 WrapperNode [2021-11-06 22:04:23,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 22:04:23,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 22:04:23,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 22:04:23,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 22:04:23,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:23,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:24,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 22:04:24,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 22:04:24,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 22:04:24,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 22:04:24,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:24,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:24,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:24,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:24,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:24,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:24,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:24,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 22:04:24,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 22:04:24,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 22:04:24,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 22:04:24,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (1/1) ... [2021-11-06 22:04:24,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 22:04:24,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:04:24,238 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 22:04:24,244 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 22:04:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 22:04:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 22:04:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 22:04:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2021-11-06 22:04:24,269 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2021-11-06 22:04:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 22:04:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 22:04:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-06 22:04:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 22:04:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 22:04:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 22:04:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 22:04:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2021-11-06 22:04:24,270 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2021-11-06 22:04:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 22:04:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 22:04:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 22:04:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 22:04:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 22:04:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure yurex_disconnect [2021-11-06 22:04:24,271 INFO L138 BoogieDeclarations]: Found implementation of procedure yurex_disconnect [2021-11-06 22:04:30,158 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L5533: #t~ret604 := main_#res; [2021-11-06 22:04:30,158 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_5_returnLabel: main_#res := 0; [2021-11-06 22:04:30,159 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 22:04:30,190 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 22:04:30,191 INFO L299 CfgBuilder]: Removed 1006 assume(true) statements. [2021-11-06 22:04:30,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:30 BoogieIcfgContainer [2021-11-06 22:04:30,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 22:04:30,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 22:04:30,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 22:04:30,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 22:04:30,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:04:21" (1/3) ... [2021-11-06 22:04:30,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473a5063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:30, skipping insertion in model container [2021-11-06 22:04:30,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:23" (2/3) ... [2021-11-06 22:04:30,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473a5063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:30, skipping insertion in model container [2021-11-06 22:04:30,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:30" (3/3) ... [2021-11-06 22:04:30,199 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2021-11-06 22:04:30,202 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 22:04:30,202 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2021-11-06 22:04:30,233 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 22:04:30,236 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 22:04:30,236 INFO L340 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2021-11-06 22:04:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 994 states, 900 states have (on average 1.4211111111111112) internal successors, (1279), 983 states have internal predecessors, (1279), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 22:04:30,259 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:30,260 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 22:04:30,260 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1067529640, now seen corresponding path program 1 times [2021-11-06 22:04:30,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:30,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386292491] [2021-11-06 22:04:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:30,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:30,677 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 22:04:30,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:30,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386292491] [2021-11-06 22:04:30,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386292491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:30,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:30,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:30,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395094149] [2021-11-06 22:04:30,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:30,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:30,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:30,695 INFO L87 Difference]: Start difference. First operand has 994 states, 900 states have (on average 1.4211111111111112) internal successors, (1279), 983 states have internal predecessors, (1279), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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 22:04:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:30,780 INFO L93 Difference]: Finished difference Result 1915 states and 2499 transitions. [2021-11-06 22:04:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:30,781 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 22:04:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:30,793 INFO L225 Difference]: With dead ends: 1915 [2021-11-06 22:04:30,793 INFO L226 Difference]: Without dead ends: 924 [2021-11-06 22:04:30,797 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 22:04:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-11-06 22:04:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2021-11-06 22:04:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 832 states have (on average 1.2668269230769231) internal successors, (1054), 913 states have internal predecessors, (1054), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1068 transitions. [2021-11-06 22:04:30,854 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1068 transitions. Word has length 29 [2021-11-06 22:04:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:30,854 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1068 transitions. [2021-11-06 22:04:30,855 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 22:04:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1068 transitions. [2021-11-06 22:04:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 22:04:30,856 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:30,856 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 22:04:30,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 22:04:30,856 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:30,857 INFO L85 PathProgramCache]: Analyzing trace with hash -601025716, now seen corresponding path program 1 times [2021-11-06 22:04:30,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:30,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385469549] [2021-11-06 22:04:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:30,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:30,951 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 22:04:30,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:30,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385469549] [2021-11-06 22:04:30,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385469549] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:30,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:30,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:30,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811059155] [2021-11-06 22:04:30,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:30,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:30,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:30,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:30,955 INFO L87 Difference]: Start difference. First operand 924 states and 1068 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 22:04:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:30,986 INFO L93 Difference]: Finished difference Result 924 states and 1068 transitions. [2021-11-06 22:04:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:30,987 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 22:04:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:30,990 INFO L225 Difference]: With dead ends: 924 [2021-11-06 22:04:30,990 INFO L226 Difference]: Without dead ends: 920 [2021-11-06 22:04:30,990 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 22:04:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-11-06 22:04:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2021-11-06 22:04:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 830 states have (on average 1.2650602409638554) internal successors, (1050), 909 states have internal predecessors, (1050), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1064 transitions. [2021-11-06 22:04:31,011 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1064 transitions. Word has length 31 [2021-11-06 22:04:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:31,012 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1064 transitions. [2021-11-06 22:04:31,012 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 22:04:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1064 transitions. [2021-11-06 22:04:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 22:04:31,013 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:31,013 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 22:04:31,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 22:04:31,013 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2059921072, now seen corresponding path program 1 times [2021-11-06 22:04:31,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:31,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042194210] [2021-11-06 22:04:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:31,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:31,102 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 22:04:31,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:31,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042194210] [2021-11-06 22:04:31,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042194210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:31,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:31,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:31,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53742617] [2021-11-06 22:04:31,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:31,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:31,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:31,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:31,104 INFO L87 Difference]: Start difference. First operand 920 states and 1064 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 22:04:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:31,135 INFO L93 Difference]: Finished difference Result 920 states and 1064 transitions. [2021-11-06 22:04:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:31,136 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 22:04:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:31,138 INFO L225 Difference]: With dead ends: 920 [2021-11-06 22:04:31,139 INFO L226 Difference]: Without dead ends: 916 [2021-11-06 22:04:31,139 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 22:04:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-11-06 22:04:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2021-11-06 22:04:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 828 states have (on average 1.2632850241545894) internal successors, (1046), 905 states have internal predecessors, (1046), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1060 transitions. [2021-11-06 22:04:31,160 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1060 transitions. Word has length 33 [2021-11-06 22:04:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:31,161 INFO L470 AbstractCegarLoop]: Abstraction has 916 states and 1060 transitions. [2021-11-06 22:04:31,161 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 22:04:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1060 transitions. [2021-11-06 22:04:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 22:04:31,162 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:31,162 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 22:04:31,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 22:04:31,162 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash 395947956, now seen corresponding path program 1 times [2021-11-06 22:04:31,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:31,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626572760] [2021-11-06 22:04:31,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:31,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:04:31,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:31,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626572760] [2021-11-06 22:04:31,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626572760] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:31,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:31,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:31,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813122350] [2021-11-06 22:04:31,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:31,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:31,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:31,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:31,251 INFO L87 Difference]: Start difference. First operand 916 states and 1060 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 22:04:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:31,328 INFO L93 Difference]: Finished difference Result 916 states and 1060 transitions. [2021-11-06 22:04:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:31,329 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 22:04:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:31,332 INFO L225 Difference]: With dead ends: 916 [2021-11-06 22:04:31,332 INFO L226 Difference]: Without dead ends: 912 [2021-11-06 22:04:31,332 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 22:04:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2021-11-06 22:04:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2021-11-06 22:04:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 826 states have (on average 1.261501210653753) internal successors, (1042), 901 states have internal predecessors, (1042), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1056 transitions. [2021-11-06 22:04:31,355 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1056 transitions. Word has length 35 [2021-11-06 22:04:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:31,355 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1056 transitions. [2021-11-06 22:04:31,355 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 22:04:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1056 transitions. [2021-11-06 22:04:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 22:04:31,356 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:31,356 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 22:04:31,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 22:04:31,357 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:31,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1745928584, now seen corresponding path program 1 times [2021-11-06 22:04:31,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:31,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389678884] [2021-11-06 22:04:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:31,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:31,442 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 22:04:31,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:31,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389678884] [2021-11-06 22:04:31,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389678884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:31,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:31,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:31,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899699223] [2021-11-06 22:04:31,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:31,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:31,444 INFO L87 Difference]: Start difference. First operand 912 states and 1056 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 22:04:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:31,479 INFO L93 Difference]: Finished difference Result 912 states and 1056 transitions. [2021-11-06 22:04:31,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:31,480 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 22:04:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:31,483 INFO L225 Difference]: With dead ends: 912 [2021-11-06 22:04:31,483 INFO L226 Difference]: Without dead ends: 908 [2021-11-06 22:04:31,483 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 22:04:31,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-11-06 22:04:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2021-11-06 22:04:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 824 states have (on average 1.2597087378640777) internal successors, (1038), 897 states have internal predecessors, (1038), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1052 transitions. [2021-11-06 22:04:31,509 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1052 transitions. Word has length 37 [2021-11-06 22:04:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:31,509 INFO L470 AbstractCegarLoop]: Abstraction has 908 states and 1052 transitions. [2021-11-06 22:04:31,509 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 22:04:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1052 transitions. [2021-11-06 22:04:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 22:04:31,510 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:31,511 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 22:04:31,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 22:04:31,511 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1495018908, now seen corresponding path program 1 times [2021-11-06 22:04:31,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:31,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594521716] [2021-11-06 22:04:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:31,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:31,590 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 22:04:31,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:31,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594521716] [2021-11-06 22:04:31,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594521716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:31,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:31,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:31,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289485171] [2021-11-06 22:04:31,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:31,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:31,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:31,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:31,592 INFO L87 Difference]: Start difference. First operand 908 states and 1052 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 22:04:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:31,629 INFO L93 Difference]: Finished difference Result 908 states and 1052 transitions. [2021-11-06 22:04:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:31,630 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 22:04:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:31,632 INFO L225 Difference]: With dead ends: 908 [2021-11-06 22:04:31,632 INFO L226 Difference]: Without dead ends: 904 [2021-11-06 22:04:31,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 22:04:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-11-06 22:04:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2021-11-06 22:04:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 822 states have (on average 1.2579075425790753) internal successors, (1034), 893 states have internal predecessors, (1034), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1048 transitions. [2021-11-06 22:04:31,660 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1048 transitions. Word has length 39 [2021-11-06 22:04:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:31,660 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1048 transitions. [2021-11-06 22:04:31,660 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 22:04:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1048 transitions. [2021-11-06 22:04:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 22:04:31,661 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:31,661 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 22:04:31,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 22:04:31,662 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:31,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2100697824, now seen corresponding path program 1 times [2021-11-06 22:04:31,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:31,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313861584] [2021-11-06 22:04:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:31,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:31,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 22:04:31,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:31,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313861584] [2021-11-06 22:04:31,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313861584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:31,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:31,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:31,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396678530] [2021-11-06 22:04:31,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:31,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:31,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:31,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:31,745 INFO L87 Difference]: Start difference. First operand 904 states and 1048 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 22:04:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:31,783 INFO L93 Difference]: Finished difference Result 904 states and 1048 transitions. [2021-11-06 22:04:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:31,784 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 22:04:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:31,787 INFO L225 Difference]: With dead ends: 904 [2021-11-06 22:04:31,787 INFO L226 Difference]: Without dead ends: 900 [2021-11-06 22:04:31,788 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 22:04:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-11-06 22:04:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2021-11-06 22:04:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 820 states have (on average 1.2560975609756098) internal successors, (1030), 889 states have internal predecessors, (1030), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1044 transitions. [2021-11-06 22:04:31,816 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1044 transitions. Word has length 41 [2021-11-06 22:04:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:31,816 INFO L470 AbstractCegarLoop]: Abstraction has 900 states and 1044 transitions. [2021-11-06 22:04:31,817 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 22:04:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1044 transitions. [2021-11-06 22:04:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 22:04:31,817 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:31,818 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:31,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 22:04:31,818 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:31,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:31,818 INFO L85 PathProgramCache]: Analyzing trace with hash -135803644, now seen corresponding path program 1 times [2021-11-06 22:04:31,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:31,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965666603] [2021-11-06 22:04:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:31,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:31,896 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 22:04:31,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:31,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965666603] [2021-11-06 22:04:31,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965666603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:31,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:31,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:31,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812475701] [2021-11-06 22:04:31,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:31,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:31,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:31,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:31,899 INFO L87 Difference]: Start difference. First operand 900 states and 1044 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 22:04:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:31,939 INFO L93 Difference]: Finished difference Result 900 states and 1044 transitions. [2021-11-06 22:04:31,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:31,939 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 22:04:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:31,942 INFO L225 Difference]: With dead ends: 900 [2021-11-06 22:04:31,942 INFO L226 Difference]: Without dead ends: 896 [2021-11-06 22:04:31,942 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 22:04:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2021-11-06 22:04:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2021-11-06 22:04:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 818 states have (on average 1.254278728606357) internal successors, (1026), 885 states have internal predecessors, (1026), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1040 transitions. [2021-11-06 22:04:31,972 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1040 transitions. Word has length 43 [2021-11-06 22:04:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:31,972 INFO L470 AbstractCegarLoop]: Abstraction has 896 states and 1040 transitions. [2021-11-06 22:04:31,972 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 22:04:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1040 transitions. [2021-11-06 22:04:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 22:04:31,973 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:31,973 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 22:04:31,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 22:04:31,992 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1658107545, now seen corresponding path program 1 times [2021-11-06 22:04:31,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:31,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936478395] [2021-11-06 22:04:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:31,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:32,070 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 22:04:32,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:32,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936478395] [2021-11-06 22:04:32,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936478395] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:32,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:32,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:32,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834210584] [2021-11-06 22:04:32,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:32,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:32,072 INFO L87 Difference]: Start difference. First operand 896 states and 1040 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 22:04:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:32,118 INFO L93 Difference]: Finished difference Result 896 states and 1040 transitions. [2021-11-06 22:04:32,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:32,119 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 22:04:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:32,122 INFO L225 Difference]: With dead ends: 896 [2021-11-06 22:04:32,122 INFO L226 Difference]: Without dead ends: 892 [2021-11-06 22:04:32,123 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 22:04:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-11-06 22:04:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2021-11-06 22:04:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 816 states have (on average 1.2524509803921569) internal successors, (1022), 881 states have internal predecessors, (1022), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1036 transitions. [2021-11-06 22:04:32,159 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1036 transitions. Word has length 45 [2021-11-06 22:04:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:32,160 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 1036 transitions. [2021-11-06 22:04:32,160 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 22:04:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1036 transitions. [2021-11-06 22:04:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 22:04:32,161 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:32,161 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:32,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 22:04:32,161 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:32,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash -8307157, now seen corresponding path program 1 times [2021-11-06 22:04:32,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:32,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89093705] [2021-11-06 22:04:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:32,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:32,237 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 22:04:32,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:32,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89093705] [2021-11-06 22:04:32,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89093705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:32,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:32,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:32,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631838374] [2021-11-06 22:04:32,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:32,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:32,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:32,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:32,240 INFO L87 Difference]: Start difference. First operand 892 states and 1036 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 22:04:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:32,286 INFO L93 Difference]: Finished difference Result 892 states and 1036 transitions. [2021-11-06 22:04:32,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:32,287 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 22:04:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:32,290 INFO L225 Difference]: With dead ends: 892 [2021-11-06 22:04:32,290 INFO L226 Difference]: Without dead ends: 888 [2021-11-06 22:04:32,291 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 22:04:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2021-11-06 22:04:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2021-11-06 22:04:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 814 states have (on average 1.2506142506142506) internal successors, (1018), 877 states have internal predecessors, (1018), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1032 transitions. [2021-11-06 22:04:32,328 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1032 transitions. Word has length 47 [2021-11-06 22:04:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:32,328 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1032 transitions. [2021-11-06 22:04:32,328 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 22:04:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1032 transitions. [2021-11-06 22:04:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 22:04:32,329 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:32,329 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 22:04:32,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 22:04:32,329 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:32,330 INFO L85 PathProgramCache]: Analyzing trace with hash 606933839, now seen corresponding path program 1 times [2021-11-06 22:04:32,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:32,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292602614] [2021-11-06 22:04:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:32,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:32,420 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 22:04:32,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:32,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292602614] [2021-11-06 22:04:32,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292602614] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:32,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:32,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:32,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762565503] [2021-11-06 22:04:32,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:32,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:32,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:32,423 INFO L87 Difference]: Start difference. First operand 888 states and 1032 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 22:04:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:32,459 INFO L93 Difference]: Finished difference Result 888 states and 1032 transitions. [2021-11-06 22:04:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:32,459 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 22:04:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:32,462 INFO L225 Difference]: With dead ends: 888 [2021-11-06 22:04:32,462 INFO L226 Difference]: Without dead ends: 884 [2021-11-06 22:04:32,462 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 22:04:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-11-06 22:04:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2021-11-06 22:04:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 812 states have (on average 1.248768472906404) internal successors, (1014), 873 states have internal predecessors, (1014), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1028 transitions. [2021-11-06 22:04:32,488 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1028 transitions. Word has length 49 [2021-11-06 22:04:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:32,488 INFO L470 AbstractCegarLoop]: Abstraction has 884 states and 1028 transitions. [2021-11-06 22:04:32,488 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 22:04:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1028 transitions. [2021-11-06 22:04:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 22:04:32,489 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:32,489 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 22:04:32,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 22:04:32,489 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash -851955501, now seen corresponding path program 1 times [2021-11-06 22:04:32,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:32,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255024591] [2021-11-06 22:04:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:32,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:04:32,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:32,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255024591] [2021-11-06 22:04:32,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255024591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:32,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:32,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:32,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571616201] [2021-11-06 22:04:32,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:32,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:32,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:32,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:32,563 INFO L87 Difference]: Start difference. First operand 884 states and 1028 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 22:04:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:32,599 INFO L93 Difference]: Finished difference Result 884 states and 1028 transitions. [2021-11-06 22:04:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:32,600 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 22:04:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:32,602 INFO L225 Difference]: With dead ends: 884 [2021-11-06 22:04:32,602 INFO L226 Difference]: Without dead ends: 880 [2021-11-06 22:04:32,603 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 22:04:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-11-06 22:04:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2021-11-06 22:04:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 810 states have (on average 1.2469135802469136) internal successors, (1010), 869 states have internal predecessors, (1010), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1024 transitions. [2021-11-06 22:04:32,629 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1024 transitions. Word has length 51 [2021-11-06 22:04:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:32,629 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1024 transitions. [2021-11-06 22:04:32,629 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 22:04:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1024 transitions. [2021-11-06 22:04:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 22:04:32,630 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:32,630 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 22:04:32,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 22:04:32,630 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1609694903, now seen corresponding path program 1 times [2021-11-06 22:04:32,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:32,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033098654] [2021-11-06 22:04:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:32,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:04:32,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:32,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033098654] [2021-11-06 22:04:32,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033098654] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:32,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:32,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:32,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959128050] [2021-11-06 22:04:32,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:32,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:32,711 INFO L87 Difference]: Start difference. First operand 880 states and 1024 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 22:04:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:32,747 INFO L93 Difference]: Finished difference Result 880 states and 1024 transitions. [2021-11-06 22:04:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:32,748 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 22:04:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:32,750 INFO L225 Difference]: With dead ends: 880 [2021-11-06 22:04:32,750 INFO L226 Difference]: Without dead ends: 876 [2021-11-06 22:04:32,751 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 22:04:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-11-06 22:04:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2021-11-06 22:04:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 808 states have (on average 1.245049504950495) internal successors, (1006), 865 states have internal predecessors, (1006), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1020 transitions. [2021-11-06 22:04:32,808 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1020 transitions. Word has length 53 [2021-11-06 22:04:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:32,808 INFO L470 AbstractCegarLoop]: Abstraction has 876 states and 1020 transitions. [2021-11-06 22:04:32,808 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 22:04:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1020 transitions. [2021-11-06 22:04:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 22:04:32,809 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:32,809 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 22:04:32,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 22:04:32,809 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash 728753403, now seen corresponding path program 1 times [2021-11-06 22:04:32,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:32,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722887735] [2021-11-06 22:04:32,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:32,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:32,885 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 22:04:32,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:32,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722887735] [2021-11-06 22:04:32,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722887735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:32,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:32,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:32,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039358587] [2021-11-06 22:04:32,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:32,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:32,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:32,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:32,887 INFO L87 Difference]: Start difference. First operand 876 states and 1020 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 22:04:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:32,924 INFO L93 Difference]: Finished difference Result 876 states and 1020 transitions. [2021-11-06 22:04:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:32,925 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 22:04:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:32,927 INFO L225 Difference]: With dead ends: 876 [2021-11-06 22:04:32,928 INFO L226 Difference]: Without dead ends: 872 [2021-11-06 22:04:32,928 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 22:04:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-11-06 22:04:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2021-11-06 22:04:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 806 states have (on average 1.2431761786600497) internal successors, (1002), 861 states have internal predecessors, (1002), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1016 transitions. [2021-11-06 22:04:32,955 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1016 transitions. Word has length 55 [2021-11-06 22:04:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:32,956 INFO L470 AbstractCegarLoop]: Abstraction has 872 states and 1016 transitions. [2021-11-06 22:04:32,956 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 22:04:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1016 transitions. [2021-11-06 22:04:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 22:04:32,956 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:32,956 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:32,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 22:04:32,957 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash 252529567, now seen corresponding path program 1 times [2021-11-06 22:04:32,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:32,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134370234] [2021-11-06 22:04:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:32,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:33,038 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 22:04:33,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:33,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134370234] [2021-11-06 22:04:33,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134370234] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:33,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:33,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:33,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111259476] [2021-11-06 22:04:33,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:33,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:33,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:33,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:33,040 INFO L87 Difference]: Start difference. First operand 872 states and 1016 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 22:04:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:33,080 INFO L93 Difference]: Finished difference Result 872 states and 1016 transitions. [2021-11-06 22:04:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:33,081 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 22:04:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:33,083 INFO L225 Difference]: With dead ends: 872 [2021-11-06 22:04:33,083 INFO L226 Difference]: Without dead ends: 868 [2021-11-06 22:04:33,084 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 22:04:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2021-11-06 22:04:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2021-11-06 22:04:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 804 states have (on average 1.2412935323383085) internal successors, (998), 857 states have internal predecessors, (998), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1012 transitions. [2021-11-06 22:04:33,112 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1012 transitions. Word has length 57 [2021-11-06 22:04:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:33,113 INFO L470 AbstractCegarLoop]: Abstraction has 868 states and 1012 transitions. [2021-11-06 22:04:33,113 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 22:04:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1012 transitions. [2021-11-06 22:04:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 22:04:33,113 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:33,114 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 22:04:33,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 22:04:33,114 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2132043101, now seen corresponding path program 1 times [2021-11-06 22:04:33,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:33,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147425619] [2021-11-06 22:04:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:33,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:33,216 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 22:04:33,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:33,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147425619] [2021-11-06 22:04:33,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147425619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:33,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:33,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:33,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155549176] [2021-11-06 22:04:33,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:33,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:33,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:33,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:33,218 INFO L87 Difference]: Start difference. First operand 868 states and 1012 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 22:04:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:33,264 INFO L93 Difference]: Finished difference Result 868 states and 1012 transitions. [2021-11-06 22:04:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:33,264 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 22:04:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:33,267 INFO L225 Difference]: With dead ends: 868 [2021-11-06 22:04:33,267 INFO L226 Difference]: Without dead ends: 864 [2021-11-06 22:04:33,267 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 22:04:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2021-11-06 22:04:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2021-11-06 22:04:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 802 states have (on average 1.2394014962593516) internal successors, (994), 853 states have internal predecessors, (994), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1008 transitions. [2021-11-06 22:04:33,303 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1008 transitions. Word has length 59 [2021-11-06 22:04:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:33,303 INFO L470 AbstractCegarLoop]: Abstraction has 864 states and 1008 transitions. [2021-11-06 22:04:33,303 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 22:04:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1008 transitions. [2021-11-06 22:04:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 22:04:33,304 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:33,304 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:33,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 22:04:33,304 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1154125248, now seen corresponding path program 1 times [2021-11-06 22:04:33,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:33,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674829803] [2021-11-06 22:04:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:33,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:33,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 22:04:33,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:33,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674829803] [2021-11-06 22:04:33,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674829803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:33,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:33,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:04:33,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642419614] [2021-11-06 22:04:33,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:04:33,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:33,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:04:33,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:04:33,443 INFO L87 Difference]: Start difference. First operand 864 states and 1008 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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 22:04:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:33,644 INFO L93 Difference]: Finished difference Result 2036 states and 2362 transitions. [2021-11-06 22:04:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:04:33,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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 22:04:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:33,648 INFO L225 Difference]: With dead ends: 2036 [2021-11-06 22:04:33,648 INFO L226 Difference]: Without dead ends: 1230 [2021-11-06 22:04:33,649 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 22:04:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-11-06 22:04:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 864. [2021-11-06 22:04:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 802 states have (on average 1.229426433915212) internal successors, (986), 853 states have internal predecessors, (986), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1000 transitions. [2021-11-06 22:04:33,693 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1000 transitions. Word has length 59 [2021-11-06 22:04:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:33,693 INFO L470 AbstractCegarLoop]: Abstraction has 864 states and 1000 transitions. [2021-11-06 22:04:33,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 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 22:04:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1000 transitions. [2021-11-06 22:04:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 22:04:33,694 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:33,694 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 22:04:33,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 22:04:33,695 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:33,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1154184830, now seen corresponding path program 1 times [2021-11-06 22:04:33,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:33,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031797156] [2021-11-06 22:04:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:33,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:33,773 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 22:04:33,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:33,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031797156] [2021-11-06 22:04:33,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031797156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:33,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:33,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:04:33,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712908068] [2021-11-06 22:04:33,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:33,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:33,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:33,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:33,776 INFO L87 Difference]: Start difference. First operand 864 states and 1000 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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 22:04:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:33,893 INFO L93 Difference]: Finished difference Result 1233 states and 1412 transitions. [2021-11-06 22:04:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:04:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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 22:04:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:33,897 INFO L225 Difference]: With dead ends: 1233 [2021-11-06 22:04:33,897 INFO L226 Difference]: Without dead ends: 1217 [2021-11-06 22:04:33,897 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 22:04:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-11-06 22:04:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 848. [2021-11-06 22:04:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 794 states have (on average 1.221662468513854) internal successors, (970), 837 states have internal predecessors, (970), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 984 transitions. [2021-11-06 22:04:33,946 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 984 transitions. Word has length 59 [2021-11-06 22:04:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:33,946 INFO L470 AbstractCegarLoop]: Abstraction has 848 states and 984 transitions. [2021-11-06 22:04:33,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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 22:04:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 984 transitions. [2021-11-06 22:04:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 22:04:33,947 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:33,947 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 22:04:33,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 22:04:33,947 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:33,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash -193840633, now seen corresponding path program 1 times [2021-11-06 22:04:33,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:33,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372261317] [2021-11-06 22:04:33,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:33,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:34,029 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 22:04:34,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:34,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372261317] [2021-11-06 22:04:34,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372261317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:34,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:34,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:34,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438247076] [2021-11-06 22:04:34,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:34,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:34,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:34,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:34,030 INFO L87 Difference]: Start difference. First operand 848 states and 984 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 22:04:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:34,084 INFO L93 Difference]: Finished difference Result 848 states and 984 transitions. [2021-11-06 22:04:34,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:34,084 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 22:04:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:34,087 INFO L225 Difference]: With dead ends: 848 [2021-11-06 22:04:34,087 INFO L226 Difference]: Without dead ends: 844 [2021-11-06 22:04:34,088 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 22:04:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-11-06 22:04:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2021-11-06 22:04:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 792 states have (on average 1.2196969696969697) internal successors, (966), 833 states have internal predecessors, (966), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 980 transitions. [2021-11-06 22:04:34,130 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 980 transitions. Word has length 61 [2021-11-06 22:04:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:34,130 INFO L470 AbstractCegarLoop]: Abstraction has 844 states and 980 transitions. [2021-11-06 22:04:34,130 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 22:04:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 980 transitions. [2021-11-06 22:04:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 22:04:34,131 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:34,131 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:34,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 22:04:34,131 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1183376910, now seen corresponding path program 1 times [2021-11-06 22:04:34,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:34,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895772105] [2021-11-06 22:04:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:34,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:34,218 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 22:04:34,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:34,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895772105] [2021-11-06 22:04:34,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895772105] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:34,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:34,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 22:04:34,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603149124] [2021-11-06 22:04:34,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:04:34,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:04:34,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:04:34,220 INFO L87 Difference]: Start difference. First operand 844 states and 980 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:34,317 INFO L93 Difference]: Finished difference Result 1599 states and 1873 transitions. [2021-11-06 22:04:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:04:34,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 22:04:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:34,320 INFO L225 Difference]: With dead ends: 1599 [2021-11-06 22:04:34,320 INFO L226 Difference]: Without dead ends: 817 [2021-11-06 22:04:34,322 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 22:04:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2021-11-06 22:04:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 817. [2021-11-06 22:04:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 774 states have (on average 1.2015503875968991) internal successors, (930), 806 states have internal predecessors, (930), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 944 transitions. [2021-11-06 22:04:34,364 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 944 transitions. Word has length 62 [2021-11-06 22:04:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:34,364 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 944 transitions. [2021-11-06 22:04:34,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 944 transitions. [2021-11-06 22:04:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 22:04:34,365 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:34,365 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 22:04:34,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 22:04:34,365 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:34,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1597074997, now seen corresponding path program 1 times [2021-11-06 22:04:34,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:34,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954479609] [2021-11-06 22:04:34,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:34,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:34,452 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 22:04:34,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:34,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954479609] [2021-11-06 22:04:34,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954479609] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:34,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:34,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:34,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288605851] [2021-11-06 22:04:34,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:34,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:34,454 INFO L87 Difference]: Start difference. First operand 817 states and 944 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 22:04:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:34,507 INFO L93 Difference]: Finished difference Result 817 states and 944 transitions. [2021-11-06 22:04:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:34,508 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 22:04:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:34,510 INFO L225 Difference]: With dead ends: 817 [2021-11-06 22:04:34,510 INFO L226 Difference]: Without dead ends: 813 [2021-11-06 22:04:34,510 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 22:04:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-11-06 22:04:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2021-11-06 22:04:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 772 states have (on average 1.1994818652849741) internal successors, (926), 802 states have internal predecessors, (926), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-06 22:04:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 940 transitions. [2021-11-06 22:04:34,552 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 940 transitions. Word has length 63 [2021-11-06 22:04:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:34,553 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 940 transitions. [2021-11-06 22:04:34,553 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 22:04:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 940 transitions. [2021-11-06 22:04:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-06 22:04:34,553 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:34,554 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 22:04:34,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 22:04:34,554 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:34,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:34,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1485567505, now seen corresponding path program 1 times [2021-11-06 22:04:34,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:34,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385139922] [2021-11-06 22:04:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:34,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:34,642 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 22:04:34,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:34,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385139922] [2021-11-06 22:04:34,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385139922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:34,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:34,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:34,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068357561] [2021-11-06 22:04:34,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:34,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:34,644 INFO L87 Difference]: Start difference. First operand 813 states and 940 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 22:04:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:34,758 INFO L93 Difference]: Finished difference Result 1476 states and 1717 transitions. [2021-11-06 22:04:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:04:34,759 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 22:04:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:34,763 INFO L225 Difference]: With dead ends: 1476 [2021-11-06 22:04:34,763 INFO L226 Difference]: Without dead ends: 1472 [2021-11-06 22:04:34,764 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 22:04:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2021-11-06 22:04:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1404. [2021-11-06 22:04:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1352 states have (on average 1.2085798816568047) internal successors, (1634), 1383 states have internal predecessors, (1634), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2021-11-06 22:04:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1669 transitions. [2021-11-06 22:04:34,902 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1669 transitions. Word has length 65 [2021-11-06 22:04:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:34,903 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 1669 transitions. [2021-11-06 22:04:34,903 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 22:04:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1669 transitions. [2021-11-06 22:04:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 22:04:34,904 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:34,904 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 22:04:34,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 22:04:34,904 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1701049741, now seen corresponding path program 1 times [2021-11-06 22:04:34,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:34,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873778121] [2021-11-06 22:04:34,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:34,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:04:34,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:34,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873778121] [2021-11-06 22:04:34,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873778121] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:34,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:34,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:34,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748650594] [2021-11-06 22:04:34,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:34,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:34,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:34,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:34,996 INFO L87 Difference]: Start difference. First operand 1404 states and 1669 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 22:04:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:35,111 INFO L93 Difference]: Finished difference Result 1404 states and 1669 transitions. [2021-11-06 22:04:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:35,112 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 22:04:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:35,116 INFO L225 Difference]: With dead ends: 1404 [2021-11-06 22:04:35,116 INFO L226 Difference]: Without dead ends: 1400 [2021-11-06 22:04:35,117 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 22:04:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2021-11-06 22:04:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1400. [2021-11-06 22:04:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1350 states have (on average 1.2074074074074075) internal successors, (1630), 1379 states have internal predecessors, (1630), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2021-11-06 22:04:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1665 transitions. [2021-11-06 22:04:35,219 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1665 transitions. Word has length 67 [2021-11-06 22:04:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:35,219 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 1665 transitions. [2021-11-06 22:04:35,219 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 22:04:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1665 transitions. [2021-11-06 22:04:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 22:04:35,220 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:35,220 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 22:04:35,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 22:04:35,220 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:35,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1673919319, now seen corresponding path program 1 times [2021-11-06 22:04:35,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:35,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934519754] [2021-11-06 22:04:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:35,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:35,311 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 22:04:35,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:35,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934519754] [2021-11-06 22:04:35,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934519754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:35,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:35,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:35,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918348945] [2021-11-06 22:04:35,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:35,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:35,314 INFO L87 Difference]: Start difference. First operand 1400 states and 1665 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 22:04:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:35,495 INFO L93 Difference]: Finished difference Result 2690 states and 3226 transitions. [2021-11-06 22:04:35,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:35,495 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 22:04:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:35,503 INFO L225 Difference]: With dead ends: 2690 [2021-11-06 22:04:35,503 INFO L226 Difference]: Without dead ends: 2598 [2021-11-06 22:04:35,504 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 22:04:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2021-11-06 22:04:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2538. [2021-11-06 22:04:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2466 states have (on average 1.2173560421735605) internal successors, (3002), 2497 states have internal predecessors, (3002), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (63), 28 states have call predecessors, (63), 28 states have call successors, (63) [2021-11-06 22:04:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3093 transitions. [2021-11-06 22:04:35,703 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3093 transitions. Word has length 69 [2021-11-06 22:04:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:35,703 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3093 transitions. [2021-11-06 22:04:35,704 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 22:04:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3093 transitions. [2021-11-06 22:04:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 22:04:35,704 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:35,705 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 22:04:35,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 22:04:35,705 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1667949682, now seen corresponding path program 1 times [2021-11-06 22:04:35,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:35,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943533360] [2021-11-06 22:04:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:35,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:35,848 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 22:04:35,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:35,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943533360] [2021-11-06 22:04:35,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943533360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:35,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:35,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 22:04:35,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702542352] [2021-11-06 22:04:35,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:04:35,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:35,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:04:35,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:04:35,851 INFO L87 Difference]: Start difference. First operand 2538 states and 3093 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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 22:04:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:36,276 INFO L93 Difference]: Finished difference Result 5952 states and 7236 transitions. [2021-11-06 22:04:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:04:36,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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 22:04:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:36,309 INFO L225 Difference]: With dead ends: 5952 [2021-11-06 22:04:36,310 INFO L226 Difference]: Without dead ends: 4393 [2021-11-06 22:04:36,316 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 22:04:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2021-11-06 22:04:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 2550. [2021-11-06 22:04:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2478 states have (on average 1.2163034705407587) internal successors, (3014), 2509 states have internal predecessors, (3014), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (63), 28 states have call predecessors, (63), 28 states have call successors, (63) [2021-11-06 22:04:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3105 transitions. [2021-11-06 22:04:36,582 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3105 transitions. Word has length 69 [2021-11-06 22:04:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:36,582 INFO L470 AbstractCegarLoop]: Abstraction has 2550 states and 3105 transitions. [2021-11-06 22:04:36,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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 22:04:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3105 transitions. [2021-11-06 22:04:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 22:04:36,584 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:36,584 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] [2021-11-06 22:04:36,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 22:04:36,584 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:36,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash -968353009, now seen corresponding path program 1 times [2021-11-06 22:04:36,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:36,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735832728] [2021-11-06 22:04:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:36,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:36,693 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 22:04:36,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:36,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735832728] [2021-11-06 22:04:36,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735832728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:36,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:36,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:36,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725309858] [2021-11-06 22:04:36,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:36,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:36,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:36,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:36,696 INFO L87 Difference]: Start difference. First operand 2550 states and 3105 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:36,955 INFO L93 Difference]: Finished difference Result 3101 states and 3723 transitions. [2021-11-06 22:04:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:04:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-11-06 22:04:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:36,963 INFO L225 Difference]: With dead ends: 3101 [2021-11-06 22:04:36,964 INFO L226 Difference]: Without dead ends: 3095 [2021-11-06 22:04:36,966 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 22:04:36,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2021-11-06 22:04:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 2544. [2021-11-06 22:04:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2475 states have (on average 1.2117171717171717) internal successors, (2999), 2503 states have internal predecessors, (2999), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (63), 28 states have call predecessors, (63), 28 states have call successors, (63) [2021-11-06 22:04:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3090 transitions. [2021-11-06 22:04:37,229 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3090 transitions. Word has length 74 [2021-11-06 22:04:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:37,229 INFO L470 AbstractCegarLoop]: Abstraction has 2544 states and 3090 transitions. [2021-11-06 22:04:37,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3090 transitions. [2021-11-06 22:04:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 22:04:37,230 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:37,231 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] [2021-11-06 22:04:37,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 22:04:37,231 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1922884671, now seen corresponding path program 1 times [2021-11-06 22:04:37,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:37,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475436761] [2021-11-06 22:04:37,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:37,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:37,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 22:04:37,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:37,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475436761] [2021-11-06 22:04:37,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475436761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:37,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:37,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:37,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58030606] [2021-11-06 22:04:37,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:04:37,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:04:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:04:37,345 INFO L87 Difference]: Start difference. First operand 2544 states and 3090 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:37,546 INFO L93 Difference]: Finished difference Result 4544 states and 5539 transitions. [2021-11-06 22:04:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:04:37,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-11-06 22:04:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:37,553 INFO L225 Difference]: With dead ends: 4544 [2021-11-06 22:04:37,553 INFO L226 Difference]: Without dead ends: 2538 [2021-11-06 22:04:37,557 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 22:04:37,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2021-11-06 22:04:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2021-11-06 22:04:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2470 states have (on average 1.2089068825910931) internal successors, (2986), 2497 states have internal predecessors, (2986), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (63), 28 states have call predecessors, (63), 28 states have call successors, (63) [2021-11-06 22:04:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3077 transitions. [2021-11-06 22:04:37,744 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3077 transitions. Word has length 76 [2021-11-06 22:04:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:37,745 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 3077 transitions. [2021-11-06 22:04:37,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3077 transitions. [2021-11-06 22:04:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-06 22:04:37,746 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:37,746 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:37,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 22:04:37,747 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:37,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1096592761, now seen corresponding path program 1 times [2021-11-06 22:04:37,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:37,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184141972] [2021-11-06 22:04:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:37,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:37,957 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 22:04:37,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:37,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184141972] [2021-11-06 22:04:37,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184141972] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:37,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:37,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:04:37,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352141167] [2021-11-06 22:04:37,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:37,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:37,961 INFO L87 Difference]: Start difference. First operand 2538 states and 3077 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:40,500 INFO L93 Difference]: Finished difference Result 3473 states and 4197 transitions. [2021-11-06 22:04:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:04:40,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-06 22:04:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:40,508 INFO L225 Difference]: With dead ends: 3473 [2021-11-06 22:04:40,508 INFO L226 Difference]: Without dead ends: 3461 [2021-11-06 22:04:40,511 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 22:04:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2021-11-06 22:04:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 2526. [2021-11-06 22:04:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2464 states have (on average 1.1996753246753247) internal successors, (2956), 2485 states have internal predecessors, (2956), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (63), 28 states have call predecessors, (63), 28 states have call successors, (63) [2021-11-06 22:04:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3047 transitions. [2021-11-06 22:04:40,761 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3047 transitions. Word has length 77 [2021-11-06 22:04:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:40,762 INFO L470 AbstractCegarLoop]: Abstraction has 2526 states and 3047 transitions. [2021-11-06 22:04:40,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3047 transitions. [2021-11-06 22:04:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 22:04:40,763 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:40,763 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] [2021-11-06 22:04:40,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 22:04:40,763 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:40,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1942372591, now seen corresponding path program 1 times [2021-11-06 22:04:40,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:40,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681195778] [2021-11-06 22:04:40,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:40,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:40,852 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 22:04:40,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:40,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681195778] [2021-11-06 22:04:40,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681195778] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:40,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:40,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 22:04:40,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759234811] [2021-11-06 22:04:40,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:04:40,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:04:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:04:40,854 INFO L87 Difference]: Start difference. First operand 2526 states and 3047 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:41,160 INFO L93 Difference]: Finished difference Result 4543 states and 5491 transitions. [2021-11-06 22:04:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 22:04:41,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2021-11-06 22:04:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:41,165 INFO L225 Difference]: With dead ends: 4543 [2021-11-06 22:04:41,166 INFO L226 Difference]: Without dead ends: 2567 [2021-11-06 22:04:41,169 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 22:04:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2021-11-06 22:04:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2520. [2021-11-06 22:04:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2459 states have (on average 1.1968279788531924) internal successors, (2943), 2479 states have internal predecessors, (2943), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (63), 28 states have call predecessors, (63), 28 states have call successors, (63) [2021-11-06 22:04:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3034 transitions. [2021-11-06 22:04:41,353 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3034 transitions. Word has length 79 [2021-11-06 22:04:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:41,353 INFO L470 AbstractCegarLoop]: Abstraction has 2520 states and 3034 transitions. [2021-11-06 22:04:41,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3034 transitions. [2021-11-06 22:04:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 22:04:41,354 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:41,354 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:41,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 22:04:41,355 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting yurex_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1881257171, now seen corresponding path program 1 times [2021-11-06 22:04:41,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:41,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647742225] [2021-11-06 22:04:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:41,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 22:04:41,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:41,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647742225] [2021-11-06 22:04:41,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647742225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:41,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:41,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:41,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991096962] [2021-11-06 22:04:41,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 22:04:41,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 22:04:41,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 22:04:41,448 INFO L87 Difference]: Start difference. First operand 2520 states and 3034 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:42,065 INFO L93 Difference]: Finished difference Result 5996 states and 7178 transitions. [2021-11-06 22:04:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 22:04:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-06 22:04:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:42,075 INFO L225 Difference]: With dead ends: 5996 [2021-11-06 22:04:42,076 INFO L226 Difference]: Without dead ends: 3993 [2021-11-06 22:04:42,082 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 22:04:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3993 states. [2021-11-06 22:04:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3993 to 2521. [2021-11-06 22:04:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2460 states have (on average 1.1967479674796748) internal successors, (2944), 2480 states have internal predecessors, (2944), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (63), 28 states have call predecessors, (63), 28 states have call successors, (63) [2021-11-06 22:04:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3035 transitions. [2021-11-06 22:04:42,333 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3035 transitions. Word has length 93 [2021-11-06 22:04:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:42,333 INFO L470 AbstractCegarLoop]: Abstraction has 2521 states and 3035 transitions. [2021-11-06 22:04:42,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3035 transitions. [2021-11-06 22:04:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-06 22:04:42,335 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:42,335 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:04:42,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 22:04:42,335 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting yurex_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:42,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1476701203, now seen corresponding path program 1 times [2021-11-06 22:04:42,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:42,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902541332] [2021-11-06 22:04:42,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:42,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:42,527 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 22:04:42,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:42,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902541332] [2021-11-06 22:04:42,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902541332] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:42,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:42,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 22:04:42,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21027615] [2021-11-06 22:04:42,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 22:04:42,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:42,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 22:04:42,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:04:42,529 INFO L87 Difference]: Start difference. First operand 2521 states and 3035 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:42,811 INFO L93 Difference]: Finished difference Result 4519 states and 5502 transitions. [2021-11-06 22:04:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 22:04:42,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-11-06 22:04:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:42,817 INFO L225 Difference]: With dead ends: 4519 [2021-11-06 22:04:42,818 INFO L226 Difference]: Without dead ends: 2517 [2021-11-06 22:04:42,822 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-06 22:04:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2021-11-06 22:04:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2517. [2021-11-06 22:04:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2460 states have (on average 1.1951219512195121) internal successors, (2940), 2476 states have internal predecessors, (2940), 24 states have call successors, (24), 16 states have call predecessors, (24), 16 states have return successors, (54), 24 states have call predecessors, (54), 24 states have call successors, (54) [2021-11-06 22:04:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3018 transitions. [2021-11-06 22:04:43,038 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3018 transitions. Word has length 96 [2021-11-06 22:04:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:43,038 INFO L470 AbstractCegarLoop]: Abstraction has 2517 states and 3018 transitions. [2021-11-06 22:04:43,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3018 transitions. [2021-11-06 22:04:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 22:04:43,039 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:43,040 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:43,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 22:04:43,040 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:43,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1892458642, now seen corresponding path program 1 times [2021-11-06 22:04:43,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:43,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113678734] [2021-11-06 22:04:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:43,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:43,442 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 22:04:43,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:43,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113678734] [2021-11-06 22:04:43,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113678734] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:43,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:43,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 22:04:43,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095954364] [2021-11-06 22:04:43,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 22:04:43,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:43,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 22:04:43,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-11-06 22:04:43,444 INFO L87 Difference]: Start difference. First operand 2517 states and 3018 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:44,134 INFO L93 Difference]: Finished difference Result 5041 states and 6042 transitions. [2021-11-06 22:04:44,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 22:04:44,135 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 22:04:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:44,139 INFO L225 Difference]: With dead ends: 5041 [2021-11-06 22:04:44,140 INFO L226 Difference]: Without dead ends: 2517 [2021-11-06 22:04:44,145 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-11-06 22:04:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2021-11-06 22:04:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2517. [2021-11-06 22:04:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2460 states have (on average 1.1947154471544716) internal successors, (2939), 2476 states have internal predecessors, (2939), 24 states have call successors, (24), 16 states have call predecessors, (24), 16 states have return successors, (54), 24 states have call predecessors, (54), 24 states have call successors, (54) [2021-11-06 22:04:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3017 transitions. [2021-11-06 22:04:44,335 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3017 transitions. Word has length 95 [2021-11-06 22:04:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:44,336 INFO L470 AbstractCegarLoop]: Abstraction has 2517 states and 3017 transitions. [2021-11-06 22:04:44,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3017 transitions. [2021-11-06 22:04:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-06 22:04:44,338 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:44,338 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:44,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 22:04:44,338 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1121725076, now seen corresponding path program 1 times [2021-11-06 22:04:44,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:44,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243402370] [2021-11-06 22:04:44,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:44,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:44,573 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 22:04:44,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:44,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243402370] [2021-11-06 22:04:44,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243402370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:44,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:44,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 22:04:44,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199632232] [2021-11-06 22:04:44,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 22:04:44,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 22:04:44,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 22:04:44,576 INFO L87 Difference]: Start difference. First operand 2517 states and 3017 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:44,975 INFO L93 Difference]: Finished difference Result 4034 states and 4892 transitions. [2021-11-06 22:04:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:04:44,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-06 22:04:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:44,981 INFO L225 Difference]: With dead ends: 4034 [2021-11-06 22:04:44,981 INFO L226 Difference]: Without dead ends: 2515 [2021-11-06 22:04:44,986 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:04:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2021-11-06 22:04:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2515. [2021-11-06 22:04:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2458 states have (on average 1.19446704637917) internal successors, (2936), 2474 states have internal predecessors, (2936), 24 states have call successors, (24), 16 states have call predecessors, (24), 16 states have return successors, (54), 24 states have call predecessors, (54), 24 states have call successors, (54) [2021-11-06 22:04:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3014 transitions. [2021-11-06 22:04:45,243 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3014 transitions. Word has length 95 [2021-11-06 22:04:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:45,244 INFO L470 AbstractCegarLoop]: Abstraction has 2515 states and 3014 transitions. [2021-11-06 22:04:45,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3014 transitions. [2021-11-06 22:04:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-06 22:04:45,245 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:45,245 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:45,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 22:04:45,245 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting yurex_disconnectErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash -640668632, now seen corresponding path program 1 times [2021-11-06 22:04:45,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:45,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102810865] [2021-11-06 22:04:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:45,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:45,394 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 22:04:45,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:45,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102810865] [2021-11-06 22:04:45,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102810865] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:45,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:45,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 22:04:45,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619724207] [2021-11-06 22:04:45,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:45,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:45,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:45,397 INFO L87 Difference]: Start difference. First operand 2515 states and 3014 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:45,698 INFO L93 Difference]: Finished difference Result 2515 states and 3014 transitions. [2021-11-06 22:04:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:04:45,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-11-06 22:04:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:45,703 INFO L225 Difference]: With dead ends: 2515 [2021-11-06 22:04:45,704 INFO L226 Difference]: Without dead ends: 2513 [2021-11-06 22:04:45,705 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 22:04:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2021-11-06 22:04:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2513. [2021-11-06 22:04:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2457 states have (on average 1.192918192918193) internal successors, (2931), 2472 states have internal predecessors, (2931), 24 states have call successors, (24), 16 states have call predecessors, (24), 16 states have return successors, (54), 24 states have call predecessors, (54), 24 states have call successors, (54) [2021-11-06 22:04:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3009 transitions. [2021-11-06 22:04:45,896 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3009 transitions. Word has length 102 [2021-11-06 22:04:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:45,897 INFO L470 AbstractCegarLoop]: Abstraction has 2513 states and 3009 transitions. [2021-11-06 22:04:45,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3009 transitions. [2021-11-06 22:04:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-06 22:04:45,898 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:45,898 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:45,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 22:04:45,898 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:45,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1741142518, now seen corresponding path program 1 times [2021-11-06 22:04:45,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:45,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375846494] [2021-11-06 22:04:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:45,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:46,098 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 22:04:46,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:46,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375846494] [2021-11-06 22:04:46,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375846494] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:46,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:46,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 22:04:46,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325617758] [2021-11-06 22:04:46,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 22:04:46,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:46,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 22:04:46,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 22:04:46,100 INFO L87 Difference]: Start difference. First operand 2513 states and 3009 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:46,831 INFO L93 Difference]: Finished difference Result 6312 states and 7514 transitions. [2021-11-06 22:04:46,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 22:04:46,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-11-06 22:04:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:46,840 INFO L225 Difference]: With dead ends: 6312 [2021-11-06 22:04:46,840 INFO L226 Difference]: Without dead ends: 3875 [2021-11-06 22:04:46,845 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-06 22:04:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2021-11-06 22:04:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 2519. [2021-11-06 22:04:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2463 states have (on average 1.1924482338611448) internal successors, (2937), 2478 states have internal predecessors, (2937), 24 states have call successors, (24), 16 states have call predecessors, (24), 16 states have return successors, (54), 24 states have call predecessors, (54), 24 states have call successors, (54) [2021-11-06 22:04:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3015 transitions. [2021-11-06 22:04:47,080 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3015 transitions. Word has length 106 [2021-11-06 22:04:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:47,080 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 3015 transitions. [2021-11-06 22:04:47,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3015 transitions. [2021-11-06 22:04:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-06 22:04:47,082 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:47,082 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:47,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 22:04:47,082 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting yurex_disconnectErr1ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash 682223971, now seen corresponding path program 1 times [2021-11-06 22:04:47,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:47,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49208845] [2021-11-06 22:04:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:47,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:47,204 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 22:04:47,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:47,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49208845] [2021-11-06 22:04:47,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49208845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:47,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:47,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 22:04:47,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631564264] [2021-11-06 22:04:47,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 22:04:47,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:47,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 22:04:47,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 22:04:47,206 INFO L87 Difference]: Start difference. First operand 2519 states and 3015 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:49,581 INFO L93 Difference]: Finished difference Result 2519 states and 3015 transitions. [2021-11-06 22:04:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 22:04:49,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-11-06 22:04:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:49,590 INFO L225 Difference]: With dead ends: 2519 [2021-11-06 22:04:49,590 INFO L226 Difference]: Without dead ends: 2517 [2021-11-06 22:04:49,591 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 22:04:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2021-11-06 22:04:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2517. [2021-11-06 22:04:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2462 states have (on average 1.190901705930138) internal successors, (2932), 2476 states have internal predecessors, (2932), 24 states have call successors, (24), 16 states have call predecessors, (24), 16 states have return successors, (54), 24 states have call predecessors, (54), 24 states have call successors, (54) [2021-11-06 22:04:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3010 transitions. [2021-11-06 22:04:49,826 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3010 transitions. Word has length 105 [2021-11-06 22:04:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:49,827 INFO L470 AbstractCegarLoop]: Abstraction has 2517 states and 3010 transitions. [2021-11-06 22:04:49,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3010 transitions. [2021-11-06 22:04:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 22:04:49,828 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:49,828 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:49,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 22:04:49,829 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:49,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1376735614, now seen corresponding path program 1 times [2021-11-06 22:04:49,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:49,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971456294] [2021-11-06 22:04:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:49,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:49,872 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:04:49,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042708000] [2021-11-06 22:04:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:49,873 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:04:49,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:04:49,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:04:49,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 22:04:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 22:04:51,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 2172 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-06 22:04:51,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 22:04:52,213 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 22:04:52,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 22:04:52,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971456294] [2021-11-06 22:04:52,214 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 22:04:52,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042708000] [2021-11-06 22:04:52,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042708000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 22:04:52,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 22:04:52,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 22:04:52,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125669429] [2021-11-06 22:04:52,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 22:04:52,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 22:04:52,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 22:04:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 22:04:52,216 INFO L87 Difference]: Start difference. First operand 2517 states and 3010 transitions. Second operand has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 22:04:52,548 INFO L93 Difference]: Finished difference Result 4511 states and 5454 transitions. [2021-11-06 22:04:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 22:04:52,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2021-11-06 22:04:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 22:04:52,553 INFO L225 Difference]: With dead ends: 4511 [2021-11-06 22:04:52,554 INFO L226 Difference]: Without dead ends: 2517 [2021-11-06 22:04:52,558 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-06 22:04:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2021-11-06 22:04:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2517. [2021-11-06 22:04:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2462 states have (on average 1.18927701056052) internal successors, (2928), 2476 states have internal predecessors, (2928), 24 states have call successors, (24), 16 states have call predecessors, (24), 16 states have return successors, (54), 24 states have call predecessors, (54), 24 states have call successors, (54) [2021-11-06 22:04:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3006 transitions. [2021-11-06 22:04:52,790 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3006 transitions. Word has length 112 [2021-11-06 22:04:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 22:04:52,790 INFO L470 AbstractCegarLoop]: Abstraction has 2517 states and 3006 transitions. [2021-11-06 22:04:52,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 22:04:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3006 transitions. [2021-11-06 22:04:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 22:04:52,792 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 22:04:52,792 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 22:04:52,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 22:04:53,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-06 22:04:53,006 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION (and 80 more)] === [2021-11-06 22:04:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 22:04:53,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1611773819, now seen corresponding path program 1 times [2021-11-06 22:04:53,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 22:04:53,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215809163] [2021-11-06 22:04:53,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:53,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 22:04:53,068 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 22:04:53,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821541953] [2021-11-06 22:04:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 22:04:53,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 22:04:53,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 22:04:53,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 22:04:53,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process Killed by 15