./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-staging-lirc-lirc_imon.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-3.0/usb_urb-drivers-staging-lirc-lirc_imon.ko.cil.out.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 4ad31f53009eb9212b5dae41e1457de69c30ec14980a0e16833bb32a9897cb78 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:21:59,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:21:59,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:21:59,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:21:59,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:21:59,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:21:59,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:21:59,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:21:59,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:21:59,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:21:59,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:21:59,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:21:59,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:21:59,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:21:59,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:21:59,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:21:59,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:21:59,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:21:59,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:21:59,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:21:59,292 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:21:59,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:21:59,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:21:59,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:21:59,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:21:59,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:21:59,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:21:59,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:21:59,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:21:59,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:21:59,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:21:59,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:21:59,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:21:59,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:21:59,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:21:59,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:21:59,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:21:59,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:21:59,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:21:59,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:21:59,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:21:59,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:21:59,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:21:59,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:21:59,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:21:59,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:21:59,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:21:59,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:21:59,332 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:21:59,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:21:59,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:21:59,333 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:21:59,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:21:59,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:21:59,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:21:59,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:21:59,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:21:59,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:21:59,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:21:59,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:21:59,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:21:59,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:21:59,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:21:59,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:21:59,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:21:59,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:21:59,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:21:59,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:21:59,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:21:59,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:21:59,336 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:21:59,336 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:21:59,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:21:59,337 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 -> 4ad31f53009eb9212b5dae41e1457de69c30ec14980a0e16833bb32a9897cb78 [2022-07-12 11:21:59,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:21:59,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:21:59,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:21:59,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:21:59,591 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:21:59,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-staging-lirc-lirc_imon.ko.cil.out.i [2022-07-12 11:21:59,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7602e9dc6/5ec0781a4bb0439c8720386ada2d989c/FLAG9a1359bb7 [2022-07-12 11:22:00,203 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:22:00,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-staging-lirc-lirc_imon.ko.cil.out.i [2022-07-12 11:22:00,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7602e9dc6/5ec0781a4bb0439c8720386ada2d989c/FLAG9a1359bb7 [2022-07-12 11:22:00,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7602e9dc6/5ec0781a4bb0439c8720386ada2d989c [2022-07-12 11:22:00,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:22:00,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:22:00,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:22:00,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:22:00,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:22:00,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:22:00" (1/1) ... [2022-07-12 11:22:00,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2c02b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:00, skipping insertion in model container [2022-07-12 11:22:00,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:22:00" (1/1) ... [2022-07-12 11:22:00,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:22:00,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:22:01,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-staging-lirc-lirc_imon.ko.cil.out.i[153430,153443] [2022-07-12 11:22:01,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:22:01,471 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:22:01,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-staging-lirc-lirc_imon.ko.cil.out.i[153430,153443] [2022-07-12 11:22:01,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:22:01,718 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:22:01,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01 WrapperNode [2022-07-12 11:22:01,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:22:01,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:22:01,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:22:01,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:22:01,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,844 INFO L137 Inliner]: procedures = 121, calls = 866, calls flagged for inlining = 46, calls inlined = 30, statements flattened = 1605 [2022-07-12 11:22:01,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:22:01,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:22:01,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:22:01,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:22:01,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:22:01,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:22:01,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:22:01,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:22:01,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (1/1) ... [2022-07-12 11:22:01,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:22:01,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:01,980 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) [2022-07-12 11:22:01,984 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 [2022-07-12 11:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-12 11:22:02,014 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-12 11:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-12 11:22:02,014 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-12 11:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure usb_match_id [2022-07-12 11:22:02,015 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_match_id [2022-07-12 11:22:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:22:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure imon_init [2022-07-12 11:22:02,015 INFO L138 BoogieDeclarations]: Found implementation of procedure imon_init [2022-07-12 11:22:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 11:22:02,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 11:22:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:22:02,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:22:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 11:22:02,016 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 11:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure imon_exit [2022-07-12 11:22:02,016 INFO L138 BoogieDeclarations]: Found implementation of procedure imon_exit [2022-07-12 11:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-07-12 11:22:02,016 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-07-12 11:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 11:22:02,016 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 11:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 11:22:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 11:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-12 11:22:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-12 11:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure free_imon_context [2022-07-12 11:22:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure free_imon_context [2022-07-12 11:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 11:22:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 11:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure lirc_buffer_free [2022-07-12 11:22:02,018 INFO L138 BoogieDeclarations]: Found implementation of procedure lirc_buffer_free [2022-07-12 11:22:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:22:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:22:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:22:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure deregister_from_lirc [2022-07-12 11:22:02,018 INFO L138 BoogieDeclarations]: Found implementation of procedure deregister_from_lirc [2022-07-12 11:22:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:22:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 11:22:02,019 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 11:22:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-12 11:22:02,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-12 11:22:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:22:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:22:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 11:22:02,034 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 11:22:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 11:22:02,034 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 11:22:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-12 11:22:02,034 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-12 11:22:02,035 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 11:22:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 11:22:02,035 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-12 11:22:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-12 11:22:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-12 11:22:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-12 11:22:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:22:02,037 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-12 11:22:02,037 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-12 11:22:02,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:22:02,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:22:02,326 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:22:02,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:22:02,547 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-12 11:22:02,637 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:22:03,457 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume !false; [2022-07-12 11:22:03,457 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume false; [2022-07-12 11:22:03,480 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:22:03,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:22:03,488 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2022-07-12 11:22:03,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:22:03 BoogieIcfgContainer [2022-07-12 11:22:03,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:22:03,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:22:03,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:22:03,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:22:03,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:22:00" (1/3) ... [2022-07-12 11:22:03,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c14e320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:22:03, skipping insertion in model container [2022-07-12 11:22:03,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:22:01" (2/3) ... [2022-07-12 11:22:03,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c14e320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:22:03, skipping insertion in model container [2022-07-12 11:22:03,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:22:03" (3/3) ... [2022-07-12 11:22:03,499 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-staging-lirc-lirc_imon.ko.cil.out.i [2022-07-12 11:22:03,508 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:22:03,508 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:22:03,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:22:03,555 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b8756da, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bb966b3 [2022-07-12 11:22:03,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:22:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 262 states have (on average 1.5038167938931297) internal successors, (394), 279 states have internal predecessors, (394), 61 states have call successors, (61), 25 states have call predecessors, (61), 24 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2022-07-12 11:22:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 11:22:03,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:03,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:03,564 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1796219403, now seen corresponding path program 1 times [2022-07-12 11:22:03,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:03,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425233801] [2022-07-12 11:22:03,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:03,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:22:04,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:04,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425233801] [2022-07-12 11:22:04,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425233801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:04,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:04,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:22:04,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986998254] [2022-07-12 11:22:04,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:04,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:04,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:04,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:22:04,052 INFO L87 Difference]: Start difference. First operand has 349 states, 262 states have (on average 1.5038167938931297) internal successors, (394), 279 states have internal predecessors, (394), 61 states have call successors, (61), 25 states have call predecessors, (61), 24 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:22:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:04,173 INFO L93 Difference]: Finished difference Result 1009 states and 1523 transitions. [2022-07-12 11:22:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:04,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-12 11:22:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:04,211 INFO L225 Difference]: With dead ends: 1009 [2022-07-12 11:22:04,219 INFO L226 Difference]: Without dead ends: 664 [2022-07-12 11:22:04,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:22:04,229 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 443 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:04,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 984 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-07-12 11:22:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2022-07-12 11:22:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 499 states have (on average 1.2925851703406814) internal successors, (645), 522 states have internal predecessors, (645), 116 states have call successors, (116), 46 states have call predecessors, (116), 45 states have return successors, (115), 109 states have call predecessors, (115), 113 states have call successors, (115) [2022-07-12 11:22:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 876 transitions. [2022-07-12 11:22:04,305 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 876 transitions. Word has length 16 [2022-07-12 11:22:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:04,306 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 876 transitions. [2022-07-12 11:22:04,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:22:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 876 transitions. [2022-07-12 11:22:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 11:22:04,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:04,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:04,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:22:04,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash 151566468, now seen corresponding path program 1 times [2022-07-12 11:22:04,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:04,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766230116] [2022-07-12 11:22:04,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:22:04,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:04,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766230116] [2022-07-12 11:22:04,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766230116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:04,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:04,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:22:04,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266794728] [2022-07-12 11:22:04,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:04,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:04,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:04,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:22:04,463 INFO L87 Difference]: Start difference. First operand 661 states and 876 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:22:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:04,494 INFO L93 Difference]: Finished difference Result 663 states and 877 transitions. [2022-07-12 11:22:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:04,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-12 11:22:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:04,500 INFO L225 Difference]: With dead ends: 663 [2022-07-12 11:22:04,500 INFO L226 Difference]: Without dead ends: 652 [2022-07-12 11:22:04,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:22:04,501 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 438 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:04,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-07-12 11:22:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2022-07-12 11:22:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 493 states have (on average 1.2880324543610548) internal successors, (635), 514 states have internal predecessors, (635), 114 states have call successors, (114), 45 states have call predecessors, (114), 44 states have return successors, (114), 108 states have call predecessors, (114), 112 states have call successors, (114) [2022-07-12 11:22:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 863 transitions. [2022-07-12 11:22:04,542 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 863 transitions. Word has length 17 [2022-07-12 11:22:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:04,544 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-12 11:22:04,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:22:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 863 transitions. [2022-07-12 11:22:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 11:22:04,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:04,546 INFO L195 NwaCegarLoop]: 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] [2022-07-12 11:22:04,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:22:04,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash -785836700, now seen corresponding path program 1 times [2022-07-12 11:22:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:04,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188047221] [2022-07-12 11:22:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:22:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:04,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188047221] [2022-07-12 11:22:04,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188047221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:04,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:04,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:22:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146351147] [2022-07-12 11:22:04,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:04,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:22:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:22:04,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:22:04,747 INFO L87 Difference]: Start difference. First operand 652 states and 863 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 11:22:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:05,205 INFO L93 Difference]: Finished difference Result 1480 states and 2016 transitions. [2022-07-12 11:22:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:22:05,206 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), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-07-12 11:22:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:05,212 INFO L225 Difference]: With dead ends: 1480 [2022-07-12 11:22:05,212 INFO L226 Difference]: Without dead ends: 840 [2022-07-12 11:22:05,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:22:05,219 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 154 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:05,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1143 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:22:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-07-12 11:22:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 666. [2022-07-12 11:22:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 507 states have (on average 1.280078895463511) internal successors, (649), 528 states have internal predecessors, (649), 114 states have call successors, (114), 45 states have call predecessors, (114), 44 states have return successors, (114), 108 states have call predecessors, (114), 112 states have call successors, (114) [2022-07-12 11:22:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 877 transitions. [2022-07-12 11:22:05,264 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 877 transitions. Word has length 45 [2022-07-12 11:22:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:05,264 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 877 transitions. [2022-07-12 11:22:05,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 11:22:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 877 transitions. [2022-07-12 11:22:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 11:22:05,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:05,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:05,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:22:05,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:05,273 INFO L85 PathProgramCache]: Analyzing trace with hash 156110253, now seen corresponding path program 1 times [2022-07-12 11:22:05,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:05,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414669051] [2022-07-12 11:22:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:05,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:22:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 11:22:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:22:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:22:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 11:22:05,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:05,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414669051] [2022-07-12 11:22:05,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414669051] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:05,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:05,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:22:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937759988] [2022-07-12 11:22:05,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:05,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:22:05,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:22:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:22:05,431 INFO L87 Difference]: Start difference. First operand 666 states and 877 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 11:22:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:05,804 INFO L93 Difference]: Finished difference Result 1392 states and 1856 transitions. [2022-07-12 11:22:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:22:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2022-07-12 11:22:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:05,807 INFO L225 Difference]: With dead ends: 1392 [2022-07-12 11:22:05,807 INFO L226 Difference]: Without dead ends: 737 [2022-07-12 11:22:05,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:22:05,809 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 267 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:05,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 814 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:22:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-07-12 11:22:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 691. [2022-07-12 11:22:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 532 states have (on average 1.2838345864661653) internal successors, (683), 553 states have internal predecessors, (683), 114 states have call successors, (114), 45 states have call predecessors, (114), 44 states have return successors, (114), 108 states have call predecessors, (114), 112 states have call successors, (114) [2022-07-12 11:22:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 911 transitions. [2022-07-12 11:22:05,829 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 911 transitions. Word has length 81 [2022-07-12 11:22:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:05,830 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 911 transitions. [2022-07-12 11:22:05,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 11:22:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 911 transitions. [2022-07-12 11:22:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 11:22:05,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:05,831 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:05,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:22:05,831 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1773089863, now seen corresponding path program 1 times [2022-07-12 11:22:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:05,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437266835] [2022-07-12 11:22:05,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:05,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:05,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:06,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:06,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:06,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:06,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 11:22:06,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:06,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437266835] [2022-07-12 11:22:06,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437266835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:06,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066607760] [2022-07-12 11:22:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:06,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:06,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:06,158 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) [2022-07-12 11:22:06,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:22:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:06,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 2443 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:22:06,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 11:22:06,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:06,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066607760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:06,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:06,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-12 11:22:06,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054058600] [2022-07-12 11:22:06,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:06,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:06,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:06,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:06,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:06,720 INFO L87 Difference]: Start difference. First operand 691 states and 911 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 11:22:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:06,785 INFO L93 Difference]: Finished difference Result 1547 states and 2086 transitions. [2022-07-12 11:22:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:06,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2022-07-12 11:22:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:06,789 INFO L225 Difference]: With dead ends: 1547 [2022-07-12 11:22:06,790 INFO L226 Difference]: Without dead ends: 868 [2022-07-12 11:22:06,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:06,807 INFO L413 NwaCegarLoop]: 472 mSDtfsCounter, 210 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:06,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 739 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-07-12 11:22:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 703. [2022-07-12 11:22:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 542 states have (on average 1.2785977859778597) internal successors, (693), 565 states have internal predecessors, (693), 116 states have call successors, (116), 45 states have call predecessors, (116), 44 states have return successors, (116), 110 states have call predecessors, (116), 114 states have call successors, (116) [2022-07-12 11:22:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 925 transitions. [2022-07-12 11:22:06,835 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 925 transitions. Word has length 80 [2022-07-12 11:22:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:06,836 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 925 transitions. [2022-07-12 11:22:06,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 11:22:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 925 transitions. [2022-07-12 11:22:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 11:22:06,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:06,838 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:06,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:07,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:07,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:07,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1761414966, now seen corresponding path program 1 times [2022-07-12 11:22:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:07,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417539394] [2022-07-12 11:22:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:22:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:22:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:22:07,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:07,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417539394] [2022-07-12 11:22:07,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417539394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:07,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401894496] [2022-07-12 11:22:07,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:07,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:07,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:07,391 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) [2022-07-12 11:22:07,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:22:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:07,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:22:07,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-12 11:22:07,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:07,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401894496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:07,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:07,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-12 11:22:07,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871612945] [2022-07-12 11:22:07,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:07,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:07,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:07,900 INFO L87 Difference]: Start difference. First operand 703 states and 925 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:22:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:07,975 INFO L93 Difference]: Finished difference Result 1571 states and 2114 transitions. [2022-07-12 11:22:07,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:07,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 112 [2022-07-12 11:22:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:07,982 INFO L225 Difference]: With dead ends: 1571 [2022-07-12 11:22:07,982 INFO L226 Difference]: Without dead ends: 880 [2022-07-12 11:22:07,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:07,986 INFO L413 NwaCegarLoop]: 472 mSDtfsCounter, 211 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:07,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 739 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-12 11:22:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 711. [2022-07-12 11:22:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 550 states have (on average 1.2745454545454546) internal successors, (701), 573 states have internal predecessors, (701), 116 states have call successors, (116), 45 states have call predecessors, (116), 44 states have return successors, (116), 110 states have call predecessors, (116), 114 states have call successors, (116) [2022-07-12 11:22:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 933 transitions. [2022-07-12 11:22:08,017 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 933 transitions. Word has length 112 [2022-07-12 11:22:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:08,019 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 933 transitions. [2022-07-12 11:22:08,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 11:22:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 933 transitions. [2022-07-12 11:22:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 11:22:08,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:08,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:08,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:08,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 11:22:08,239 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:08,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash -616076705, now seen corresponding path program 1 times [2022-07-12 11:22:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:08,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111201040] [2022-07-12 11:22:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:08,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:22:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:22:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:22:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:22:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:22:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:22:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 11:22:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111201040] [2022-07-12 11:22:08,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111201040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46042791] [2022-07-12 11:22:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:08,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:08,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:08,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:08,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:22:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 11:22:08,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 11:22:08,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:08,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46042791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:08,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:08,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-12 11:22:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413594117] [2022-07-12 11:22:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:08,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:22:08,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:08,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:22:08,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:22:08,978 INFO L87 Difference]: Start difference. First operand 711 states and 933 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:22:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:09,013 INFO L93 Difference]: Finished difference Result 1414 states and 1857 transitions. [2022-07-12 11:22:09,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:22:09,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2022-07-12 11:22:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:09,017 INFO L225 Difference]: With dead ends: 1414 [2022-07-12 11:22:09,017 INFO L226 Difference]: Without dead ends: 711 [2022-07-12 11:22:09,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:22:09,019 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:09,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1766 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-07-12 11:22:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2022-07-12 11:22:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 550 states have (on average 1.2727272727272727) internal successors, (700), 573 states have internal predecessors, (700), 116 states have call successors, (116), 45 states have call predecessors, (116), 44 states have return successors, (116), 110 states have call predecessors, (116), 114 states have call successors, (116) [2022-07-12 11:22:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 932 transitions. [2022-07-12 11:22:09,049 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 932 transitions. Word has length 121 [2022-07-12 11:22:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:09,049 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 932 transitions. [2022-07-12 11:22:09,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:22:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 932 transitions. [2022-07-12 11:22:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 11:22:09,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:09,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:09,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:09,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:09,263 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1762617218, now seen corresponding path program 1 times [2022-07-12 11:22:09,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:09,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108865616] [2022-07-12 11:22:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:22:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:22:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:22:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:22:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:22:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:22:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 11:22:09,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:09,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108865616] [2022-07-12 11:22:09,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108865616] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:09,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800641914] [2022-07-12 11:22:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:09,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:09,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:09,448 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:09,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:22:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 2605 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 11:22:09,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 11:22:09,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:09,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800641914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:09,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:09,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-12 11:22:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182923036] [2022-07-12 11:22:09,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:09,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:22:09,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:09,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:22:09,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:22:09,927 INFO L87 Difference]: Start difference. First operand 711 states and 932 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 11:22:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:10,033 INFO L93 Difference]: Finished difference Result 1456 states and 1910 transitions. [2022-07-12 11:22:10,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:22:10,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 121 [2022-07-12 11:22:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:10,037 INFO L225 Difference]: With dead ends: 1456 [2022-07-12 11:22:10,037 INFO L226 Difference]: Without dead ends: 734 [2022-07-12 11:22:10,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:22:10,039 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 32 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:10,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1782 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:22:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-07-12 11:22:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 712. [2022-07-12 11:22:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 554 states have (on average 1.2617328519855595) internal successors, (699), 574 states have internal predecessors, (699), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (112), 106 states have call predecessors, (112), 110 states have call successors, (112) [2022-07-12 11:22:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 924 transitions. [2022-07-12 11:22:10,066 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 924 transitions. Word has length 121 [2022-07-12 11:22:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:10,066 INFO L495 AbstractCegarLoop]: Abstraction has 712 states and 924 transitions. [2022-07-12 11:22:10,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 11:22:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 924 transitions. [2022-07-12 11:22:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 11:22:10,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:10,068 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:10,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:10,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:10,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash -267357553, now seen corresponding path program 1 times [2022-07-12 11:22:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:10,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510987228] [2022-07-12 11:22:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:22:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:22:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:22:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:22:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:22:10,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:10,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510987228] [2022-07-12 11:22:10,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510987228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:10,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608605424] [2022-07-12 11:22:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:10,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:10,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:10,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:10,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:22:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:22:11,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-12 11:22:11,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:11,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608605424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:11,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:11,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-12 11:22:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794697446] [2022-07-12 11:22:11,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:11,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:11,082 INFO L87 Difference]: Start difference. First operand 712 states and 924 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 11:22:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:11,140 INFO L93 Difference]: Finished difference Result 947 states and 1262 transitions. [2022-07-12 11:22:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 135 [2022-07-12 11:22:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:11,143 INFO L225 Difference]: With dead ends: 947 [2022-07-12 11:22:11,143 INFO L226 Difference]: Without dead ends: 891 [2022-07-12 11:22:11,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:11,146 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 208 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:11,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 744 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-07-12 11:22:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 715. [2022-07-12 11:22:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 557 states have (on average 1.26032315978456) internal successors, (702), 577 states have internal predecessors, (702), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (112), 106 states have call predecessors, (112), 110 states have call successors, (112) [2022-07-12 11:22:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 927 transitions. [2022-07-12 11:22:11,171 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 927 transitions. Word has length 135 [2022-07-12 11:22:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:11,171 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 927 transitions. [2022-07-12 11:22:11,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 11:22:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 927 transitions. [2022-07-12 11:22:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 11:22:11,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:11,173 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:11,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:11,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:11,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash 238024164, now seen corresponding path program 1 times [2022-07-12 11:22:11,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:11,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866190165] [2022-07-12 11:22:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:11,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:22:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:22:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:22:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:22:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:22:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 11:22:11,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:11,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866190165] [2022-07-12 11:22:11,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866190165] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:11,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510967943] [2022-07-12 11:22:11,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:11,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:11,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:11,685 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:11,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:22:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:22:12,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-12 11:22:12,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:12,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510967943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:12,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:12,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 11:22:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281814312] [2022-07-12 11:22:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:12,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:12,249 INFO L87 Difference]: Start difference. First operand 715 states and 927 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:22:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:12,308 INFO L93 Difference]: Finished difference Result 952 states and 1269 transitions. [2022-07-12 11:22:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:12,308 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 153 [2022-07-12 11:22:12,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:12,311 INFO L225 Difference]: With dead ends: 952 [2022-07-12 11:22:12,311 INFO L226 Difference]: Without dead ends: 896 [2022-07-12 11:22:12,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:12,312 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 215 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:12,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 737 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-12 11:22:12,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 717. [2022-07-12 11:22:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 559 states have (on average 1.259391771019678) internal successors, (704), 579 states have internal predecessors, (704), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (112), 106 states have call predecessors, (112), 110 states have call successors, (112) [2022-07-12 11:22:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 929 transitions. [2022-07-12 11:22:12,336 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 929 transitions. Word has length 153 [2022-07-12 11:22:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:12,337 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 929 transitions. [2022-07-12 11:22:12,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:22:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 929 transitions. [2022-07-12 11:22:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 11:22:12,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:12,339 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:12,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 11:22:12,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:12,555 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1047500121, now seen corresponding path program 1 times [2022-07-12 11:22:12,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:12,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836161698] [2022-07-12 11:22:12,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:12,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:22:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:22:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:22:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:22:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:22:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:22:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-12 11:22:12,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:12,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836161698] [2022-07-12 11:22:12,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836161698] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:12,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225320847] [2022-07-12 11:22:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:12,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:12,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:12,867 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:12,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:22:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 2923 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:22:13,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-12 11:22:13,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:13,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225320847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:13,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:13,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 11:22:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023175765] [2022-07-12 11:22:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:13,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:13,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:13,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:13,477 INFO L87 Difference]: Start difference. First operand 717 states and 929 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 11:22:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:13,533 INFO L93 Difference]: Finished difference Result 956 states and 1274 transitions. [2022-07-12 11:22:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:13,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 171 [2022-07-12 11:22:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:13,538 INFO L225 Difference]: With dead ends: 956 [2022-07-12 11:22:13,538 INFO L226 Difference]: Without dead ends: 900 [2022-07-12 11:22:13,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:13,539 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 216 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:13,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 737 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-07-12 11:22:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 719. [2022-07-12 11:22:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 561 states have (on average 1.2584670231729056) internal successors, (706), 579 states have internal predecessors, (706), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (112), 106 states have call predecessors, (112), 110 states have call successors, (112) [2022-07-12 11:22:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 931 transitions. [2022-07-12 11:22:13,572 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 931 transitions. Word has length 171 [2022-07-12 11:22:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:13,572 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 931 transitions. [2022-07-12 11:22:13,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 11:22:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 931 transitions. [2022-07-12 11:22:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-12 11:22:13,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:13,576 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:13,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-12 11:22:13,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:13,791 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:13,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash 674277908, now seen corresponding path program 1 times [2022-07-12 11:22:13,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:13,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052215297] [2022-07-12 11:22:13,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:13,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:22:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:22:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:22:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:22:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:22:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:22:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-12 11:22:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:14,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052215297] [2022-07-12 11:22:14,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052215297] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:14,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659157915] [2022-07-12 11:22:14,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:14,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:14,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:14,096 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:14,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:22:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 2924 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:22:14,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:22:14,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:14,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659157915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:14,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:14,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 11:22:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155720337] [2022-07-12 11:22:14,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:14,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:14,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:14,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:14,688 INFO L87 Difference]: Start difference. First operand 719 states and 931 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:22:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:14,728 INFO L93 Difference]: Finished difference Result 1647 states and 2176 transitions. [2022-07-12 11:22:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 172 [2022-07-12 11:22:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:14,733 INFO L225 Difference]: With dead ends: 1647 [2022-07-12 11:22:14,733 INFO L226 Difference]: Without dead ends: 940 [2022-07-12 11:22:14,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:14,736 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 116 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:14,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 906 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-07-12 11:22:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 779. [2022-07-12 11:22:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 621 states have (on average 1.2624798711755234) internal successors, (784), 639 states have internal predecessors, (784), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (112), 106 states have call predecessors, (112), 110 states have call successors, (112) [2022-07-12 11:22:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1009 transitions. [2022-07-12 11:22:14,765 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1009 transitions. Word has length 172 [2022-07-12 11:22:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:14,765 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1009 transitions. [2022-07-12 11:22:14,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:22:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1009 transitions. [2022-07-12 11:22:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 11:22:14,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:14,766 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:14,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:14,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 11:22:14,989 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1219298443, now seen corresponding path program 1 times [2022-07-12 11:22:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:14,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636614031] [2022-07-12 11:22:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:22:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:22:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:22:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:22:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:22:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:22:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:22:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 11:22:15,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:15,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636614031] [2022-07-12 11:22:15,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636614031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:15,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661406997] [2022-07-12 11:22:15,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:15,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:15,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:15,262 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:15,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:22:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 2767 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:22:15,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 11:22:15,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:15,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661406997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:15,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:15,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-12 11:22:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59691868] [2022-07-12 11:22:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:15,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:15,837 INFO L87 Difference]: Start difference. First operand 779 states and 1009 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:22:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:15,914 INFO L93 Difference]: Finished difference Result 1721 states and 2265 transitions. [2022-07-12 11:22:15,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:15,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2022-07-12 11:22:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:15,918 INFO L225 Difference]: With dead ends: 1721 [2022-07-12 11:22:15,918 INFO L226 Difference]: Without dead ends: 939 [2022-07-12 11:22:15,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:15,921 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 72 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:15,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 875 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-12 11:22:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 780. [2022-07-12 11:22:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 622 states have (on average 1.2540192926045015) internal successors, (780), 638 states have internal predecessors, (780), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (112), 106 states have call predecessors, (112), 110 states have call successors, (112) [2022-07-12 11:22:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1005 transitions. [2022-07-12 11:22:15,951 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1005 transitions. Word has length 157 [2022-07-12 11:22:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:15,952 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1005 transitions. [2022-07-12 11:22:15,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:22:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1005 transitions. [2022-07-12 11:22:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-12 11:22:15,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:15,954 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:15,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:16,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 11:22:16,171 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:16,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1524066826, now seen corresponding path program 1 times [2022-07-12 11:22:16,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:16,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457958652] [2022-07-12 11:22:16,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:16,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:22:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:22:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:22:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:22:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 11:22:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 11:22:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 11:22:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:16,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457958652] [2022-07-12 11:22:16,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457958652] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:16,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435330361] [2022-07-12 11:22:16,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:16,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:16,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:16,491 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:16,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:22:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 2964 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:22:17,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:22:17,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:17,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435330361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:17,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:17,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 11:22:17,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872286359] [2022-07-12 11:22:17,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:17,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:17,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:17,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:17,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:17,092 INFO L87 Difference]: Start difference. First operand 780 states and 1005 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:22:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:17,145 INFO L93 Difference]: Finished difference Result 2019 states and 2670 transitions. [2022-07-12 11:22:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:17,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 188 [2022-07-12 11:22:17,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:17,149 INFO L225 Difference]: With dead ends: 2019 [2022-07-12 11:22:17,149 INFO L226 Difference]: Without dead ends: 1227 [2022-07-12 11:22:17,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:17,151 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 196 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:17,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1061 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-07-12 11:22:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 832. [2022-07-12 11:22:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 674 states have (on average 1.2566765578635015) internal successors, (847), 690 states have internal predecessors, (847), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (112), 106 states have call predecessors, (112), 110 states have call successors, (112) [2022-07-12 11:22:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1072 transitions. [2022-07-12 11:22:17,183 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1072 transitions. Word has length 188 [2022-07-12 11:22:17,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:17,184 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1072 transitions. [2022-07-12 11:22:17,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:22:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1072 transitions. [2022-07-12 11:22:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-12 11:22:17,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:17,186 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:17,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:17,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 11:22:17,395 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash 450945966, now seen corresponding path program 1 times [2022-07-12 11:22:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:17,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95371115] [2022-07-12 11:22:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:22:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:22:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:22:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:22:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 11:22:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 11:22:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 11:22:17,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:17,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95371115] [2022-07-12 11:22:17,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95371115] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:17,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731533507] [2022-07-12 11:22:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:17,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:17,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:17,715 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:17,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 11:22:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 2966 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:22:18,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:22:18,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:18,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731533507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:18,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:18,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 11:22:18,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231825796] [2022-07-12 11:22:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:18,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:18,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:18,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:18,367 INFO L87 Difference]: Start difference. First operand 832 states and 1072 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:22:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:18,425 INFO L93 Difference]: Finished difference Result 2185 states and 2888 transitions. [2022-07-12 11:22:18,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:18,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 191 [2022-07-12 11:22:18,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:18,430 INFO L225 Difference]: With dead ends: 2185 [2022-07-12 11:22:18,430 INFO L226 Difference]: Without dead ends: 1345 [2022-07-12 11:22:18,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:18,432 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 193 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:18,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1055 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-07-12 11:22:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 931. [2022-07-12 11:22:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 773 states have (on average 1.2652005174644243) internal successors, (978), 789 states have internal predecessors, (978), 113 states have call successors, (113), 45 states have call predecessors, (113), 44 states have return successors, (112), 106 states have call predecessors, (112), 110 states have call successors, (112) [2022-07-12 11:22:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1203 transitions. [2022-07-12 11:22:18,485 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1203 transitions. Word has length 191 [2022-07-12 11:22:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:18,485 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1203 transitions. [2022-07-12 11:22:18,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:22:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1203 transitions. [2022-07-12 11:22:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-12 11:22:18,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:18,487 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:18,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:18,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 11:22:18,704 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1205651782, now seen corresponding path program 1 times [2022-07-12 11:22:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:18,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017153508] [2022-07-12 11:22:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:18,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:22:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:22:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:22:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:22:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:22:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:22:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 11:22:18,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:18,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017153508] [2022-07-12 11:22:18,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017153508] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:18,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160090636] [2022-07-12 11:22:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:18,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:18,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:18,984 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:18,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 11:22:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 2968 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 11:22:19,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:22:19,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:19,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160090636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:19,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:19,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-12 11:22:19,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782725020] [2022-07-12 11:22:19,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:19,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:22:19,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:19,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:22:19,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:19,686 INFO L87 Difference]: Start difference. First operand 931 states and 1203 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:22:19,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:19,839 INFO L93 Difference]: Finished difference Result 1911 states and 2490 transitions. [2022-07-12 11:22:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:22:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 194 [2022-07-12 11:22:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:19,846 INFO L225 Difference]: With dead ends: 1911 [2022-07-12 11:22:19,846 INFO L226 Difference]: Without dead ends: 992 [2022-07-12 11:22:19,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:22:19,848 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 181 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:19,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1765 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:22:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-07-12 11:22:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 883. [2022-07-12 11:22:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 735 states have (on average 1.2612244897959184) internal successors, (927), 748 states have internal predecessors, (927), 102 states have call successors, (102), 45 states have call predecessors, (102), 45 states have return successors, (103), 97 states have call predecessors, (103), 100 states have call successors, (103) [2022-07-12 11:22:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1132 transitions. [2022-07-12 11:22:19,886 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1132 transitions. Word has length 194 [2022-07-12 11:22:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:19,887 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1132 transitions. [2022-07-12 11:22:19,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:22:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1132 transitions. [2022-07-12 11:22:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-12 11:22:19,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:19,889 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:19,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:20,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 11:22:20,104 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1391975651, now seen corresponding path program 1 times [2022-07-12 11:22:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:20,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116362076] [2022-07-12 11:22:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:22:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:22:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:22:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:22:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:22:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 11:22:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 11:22:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 11:22:20,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:20,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116362076] [2022-07-12 11:22:20,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116362076] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:20,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426892739] [2022-07-12 11:22:20,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:20,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:20,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:20,360 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:20,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 11:22:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:20,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 2922 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:22:20,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:22:20,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:20,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426892739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:20,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:20,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 11:22:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273997744] [2022-07-12 11:22:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:20,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:20,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:20,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:20,984 INFO L87 Difference]: Start difference. First operand 883 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:22:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:21,030 INFO L93 Difference]: Finished difference Result 1774 states and 2281 transitions. [2022-07-12 11:22:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:21,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 192 [2022-07-12 11:22:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:21,036 INFO L225 Difference]: With dead ends: 1774 [2022-07-12 11:22:21,037 INFO L226 Difference]: Without dead ends: 896 [2022-07-12 11:22:21,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:21,038 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 12 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:21,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 883 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-12 11:22:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 880. [2022-07-12 11:22:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 733 states have (on average 1.2605729877216916) internal successors, (924), 746 states have internal predecessors, (924), 102 states have call successors, (102), 45 states have call predecessors, (102), 44 states have return successors, (102), 96 states have call predecessors, (102), 100 states have call successors, (102) [2022-07-12 11:22:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1128 transitions. [2022-07-12 11:22:21,069 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1128 transitions. Word has length 192 [2022-07-12 11:22:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:21,070 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1128 transitions. [2022-07-12 11:22:21,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:22:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1128 transitions. [2022-07-12 11:22:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-12 11:22:21,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:21,073 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:21,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 11:22:21,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 11:22:21,295 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash -978025145, now seen corresponding path program 1 times [2022-07-12 11:22:21,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:21,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87456860] [2022-07-12 11:22:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:22:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:22:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:22:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:22:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:22:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:22:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 11:22:21,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:21,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87456860] [2022-07-12 11:22:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87456860] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:21,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761235352] [2022-07-12 11:22:21,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:21,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:21,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:21,566 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:21,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 11:22:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 2967 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 11:22:22,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 11:22:22,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-12 11:22:22,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761235352] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:22:22,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:22:22,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 7] total 19 [2022-07-12 11:22:22,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269297744] [2022-07-12 11:22:22,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:22,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 11:22:22,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:22,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 11:22:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:22:22,662 INFO L87 Difference]: Start difference. First operand 880 states and 1128 transitions. Second operand has 19 states, 19 states have (on average 13.0) internal successors, (247), 14 states have internal predecessors, (247), 8 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (47), 10 states have call predecessors, (47), 8 states have call successors, (47) [2022-07-12 11:22:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:26,009 INFO L93 Difference]: Finished difference Result 2336 states and 3024 transitions. [2022-07-12 11:22:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 11:22:26,010 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.0) internal successors, (247), 14 states have internal predecessors, (247), 8 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (47), 10 states have call predecessors, (47), 8 states have call successors, (47) Word has length 194 [2022-07-12 11:22:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:26,014 INFO L225 Difference]: With dead ends: 2336 [2022-07-12 11:22:26,014 INFO L226 Difference]: Without dead ends: 1466 [2022-07-12 11:22:26,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=333, Invalid=1389, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 11:22:26,017 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 1804 mSDsluCounter, 5368 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 854 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1877 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 3960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 854 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:26,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1877 Valid, 6021 Invalid, 3960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [854 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 11:22:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-07-12 11:22:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1392. [2022-07-12 11:22:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1161 states have (on average 1.2609819121447028) internal successors, (1464), 1183 states have internal predecessors, (1464), 154 states have call successors, (154), 66 states have call predecessors, (154), 76 states have return successors, (191), 155 states have call predecessors, (191), 152 states have call successors, (191) [2022-07-12 11:22:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1809 transitions. [2022-07-12 11:22:26,075 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1809 transitions. Word has length 194 [2022-07-12 11:22:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:26,075 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1809 transitions. [2022-07-12 11:22:26,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.0) internal successors, (247), 14 states have internal predecessors, (247), 8 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (47), 10 states have call predecessors, (47), 8 states have call successors, (47) [2022-07-12 11:22:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1809 transitions. [2022-07-12 11:22:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-12 11:22:26,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:26,076 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:26,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-12 11:22:26,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:26,291 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:26,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1754849822, now seen corresponding path program 1 times [2022-07-12 11:22:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:26,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696964807] [2022-07-12 11:22:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:22:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:22:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:22:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:22:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:22:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 11:22:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:22:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:22:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:22:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 11:22:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 11:22:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-12 11:22:26,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:26,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696964807] [2022-07-12 11:22:26,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696964807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:26,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:26,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:22:26,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675136622] [2022-07-12 11:22:26,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:26,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:22:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:26,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:22:26,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:22:26,479 INFO L87 Difference]: Start difference. First operand 1392 states and 1809 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:22:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:26,839 INFO L93 Difference]: Finished difference Result 2832 states and 3690 transitions. [2022-07-12 11:22:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:22:26,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 198 [2022-07-12 11:22:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:26,845 INFO L225 Difference]: With dead ends: 2832 [2022-07-12 11:22:26,845 INFO L226 Difference]: Without dead ends: 1446 [2022-07-12 11:22:26,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:22:26,848 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 94 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:26,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1014 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:22:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2022-07-12 11:22:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1376. [2022-07-12 11:22:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1145 states have (on average 1.262008733624454) internal successors, (1445), 1167 states have internal predecessors, (1445), 154 states have call successors, (154), 66 states have call predecessors, (154), 76 states have return successors, (191), 155 states have call predecessors, (191), 152 states have call successors, (191) [2022-07-12 11:22:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1790 transitions. [2022-07-12 11:22:26,911 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1790 transitions. Word has length 198 [2022-07-12 11:22:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:26,911 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 1790 transitions. [2022-07-12 11:22:26,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:22:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1790 transitions. [2022-07-12 11:22:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-12 11:22:26,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:26,913 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:26,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 11:22:26,913 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash 913659289, now seen corresponding path program 1 times [2022-07-12 11:22:26,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:26,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77679070] [2022-07-12 11:22:26,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:26,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:26,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:22:26,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736899115] [2022-07-12 11:22:26,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:26,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:26,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:26,973 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:26,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 11:22:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 2982 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 11:22:27,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 11:22:27,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:27,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:27,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77679070] [2022-07-12 11:22:27,725 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:22:27,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736899115] [2022-07-12 11:22:27,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736899115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:27,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:27,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:22:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634884183] [2022-07-12 11:22:27,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:27,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:22:27,727 INFO L87 Difference]: Start difference. First operand 1376 states and 1790 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 11:22:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:28,083 INFO L93 Difference]: Finished difference Result 1671 states and 2222 transitions. [2022-07-12 11:22:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:28,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 201 [2022-07-12 11:22:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:28,096 INFO L225 Difference]: With dead ends: 1671 [2022-07-12 11:22:28,096 INFO L226 Difference]: Without dead ends: 1633 [2022-07-12 11:22:28,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:22:28,099 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 119 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:28,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 921 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:22:28,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-07-12 11:22:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1376. [2022-07-12 11:22:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1145 states have (on average 1.2602620087336245) internal successors, (1443), 1167 states have internal predecessors, (1443), 154 states have call successors, (154), 66 states have call predecessors, (154), 76 states have return successors, (191), 155 states have call predecessors, (191), 152 states have call successors, (191) [2022-07-12 11:22:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1788 transitions. [2022-07-12 11:22:28,180 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1788 transitions. Word has length 201 [2022-07-12 11:22:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:28,180 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 1788 transitions. [2022-07-12 11:22:28,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 11:22:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1788 transitions. [2022-07-12 11:22:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-12 11:22:28,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:28,182 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:28,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:28,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:28,395 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1938080626, now seen corresponding path program 1 times [2022-07-12 11:22:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:28,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424036300] [2022-07-12 11:22:28,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:28,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:22:28,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365217409] [2022-07-12 11:22:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:28,449 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:28,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 11:22:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:22:29,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 11:22:29,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:29,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:29,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424036300] [2022-07-12 11:22:29,227 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:22:29,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365217409] [2022-07-12 11:22:29,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365217409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:29,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:29,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:22:29,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032945430] [2022-07-12 11:22:29,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:29,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:29,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:29,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:22:29,228 INFO L87 Difference]: Start difference. First operand 1376 states and 1788 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 11:22:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:29,246 INFO L93 Difference]: Finished difference Result 1470 states and 1895 transitions. [2022-07-12 11:22:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:29,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 207 [2022-07-12 11:22:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:29,247 INFO L225 Difference]: With dead ends: 1470 [2022-07-12 11:22:29,247 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 11:22:29,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:22:29,249 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 18 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:29,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 190 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 11:22:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 11:22:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 11:22:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 11:22:29,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-07-12 11:22:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:29,250 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 11:22:29,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 11:22:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 11:22:29,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 11:22:29,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:22:29,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:29,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:29,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 11:22:32,226 INFO L899 garLoopResultBuilder]: For program point usb_fill_int_urbFINAL(lines 3484 3507) no Hoare annotation was computed. [2022-07-12 11:22:32,226 INFO L899 garLoopResultBuilder]: For program point L3499(lines 3499 3503) no Hoare annotation was computed. [2022-07-12 11:22:32,226 INFO L899 garLoopResultBuilder]: For program point L3496(lines 3496 3503) no Hoare annotation was computed. [2022-07-12 11:22:32,226 INFO L899 garLoopResultBuilder]: For program point L3499-2(lines 3496 3503) no Hoare annotation was computed. [2022-07-12 11:22:32,226 INFO L899 garLoopResultBuilder]: For program point usb_fill_int_urbEXIT(lines 3484 3507) no Hoare annotation was computed. [2022-07-12 11:22:32,226 INFO L902 garLoopResultBuilder]: At program point usb_fill_int_urbENTRY(lines 3484 3507) the Hoare annotation is: true [2022-07-12 11:22:32,226 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 5686 5688) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 5686 5688) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |old(#valid)| |#valid|)) [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 5686 5688) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point usb_get_intfdataEXIT(lines 3440 3448) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L902 garLoopResultBuilder]: At program point usb_get_intfdataENTRY(lines 3440 3448) the Hoare annotation is: true [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point usb_get_intfdataFINAL(lines 3440 3448) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point L5604-1(line 5604) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L902 garLoopResultBuilder]: At program point L5604-2(lines 5603 5605) the Hoare annotation is: true [2022-07-12 11:22:32,227 INFO L902 garLoopResultBuilder]: At program point L5604(line 5604) the Hoare annotation is: true [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point usb_submit_urbFINAL(lines 5675 5677) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point usb_submit_urbEXIT(lines 5675 5677) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L902 garLoopResultBuilder]: At program point usb_submit_urbENTRY(lines 5675 5677) the Hoare annotation is: true [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point L5664-1(line 5664) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point usb_match_idFINAL(lines 5663 5665) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L895 garLoopResultBuilder]: At program point L5664(line 5664) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point usb_match_idEXIT(lines 5663 5665) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L895 garLoopResultBuilder]: At program point usb_match_idENTRY(lines 5663 5665) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:22:32,227 INFO L902 garLoopResultBuilder]: At program point mutex_unlockENTRY(lines 5641 5643) the Hoare annotation is: true [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point mutex_unlockEXIT(lines 5641 5643) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point mutex_unlockFINAL(lines 5641 5643) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L895 garLoopResultBuilder]: At program point L3420(line 3420) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point L3420-1(line 3420) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3416 3424) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L895 garLoopResultBuilder]: At program point kzallocENTRY(lines 3416 3424) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3416 3424) no Hoare annotation was computed. [2022-07-12 11:22:32,227 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 5405 5411) the Hoare annotation is: true [2022-07-12 11:22:32,227 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 5405 5411) no Hoare annotation was computed. [2022-07-12 11:22:32,228 INFO L895 garLoopResultBuilder]: At program point kmallocENTRY(lines 3405 3414) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:22:32,228 INFO L895 garLoopResultBuilder]: At program point L5575(line 5575) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:22:32,228 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 3405 3414) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point L5575-1(line 5575) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 3405 3414) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L902 garLoopResultBuilder]: At program point L5575-2(lines 5574 5576) the Hoare annotation is: true [2022-07-12 11:22:32,229 INFO L902 garLoopResultBuilder]: At program point L5633(lines 5632 5634) the Hoare annotation is: true [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point deregister_from_lircEXIT(lines 3903 3923) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point L3911(lines 3911 3920) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L902 garLoopResultBuilder]: At program point deregister_from_lircENTRY(lines 3903 3923) the Hoare annotation is: true [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point L3911-2(lines 3903 3923) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point mutex_lock_nestedFINAL(lines 5638 5640) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L902 garLoopResultBuilder]: At program point mutex_lock_nestedENTRY(lines 5638 5640) the Hoare annotation is: true [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point mutex_lock_nestedEXIT(lines 5638 5640) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3451 3459) the Hoare annotation is: true [2022-07-12 11:22:32,229 INFO L902 garLoopResultBuilder]: At program point L5612(lines 5611 5613) the Hoare annotation is: true [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3451 3459) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3451 3459) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L902 garLoopResultBuilder]: At program point __init_waitqueue_headENTRY(lines 5549 5551) the Hoare annotation is: true [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point __init_waitqueue_headFINAL(lines 5549 5551) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point __init_waitqueue_headEXIT(lines 5549 5551) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 5624 5626) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point L5625(line 5625) no Hoare annotation was computed. [2022-07-12 11:22:32,229 INFO L902 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 5624 5626) the Hoare annotation is: true [2022-07-12 11:22:32,229 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 5624 5626) no Hoare annotation was computed. [2022-07-12 11:22:32,230 INFO L899 garLoopResultBuilder]: For program point imon_initEXIT(lines 5234 5250) no Hoare annotation was computed. [2022-07-12 11:22:32,230 INFO L902 garLoopResultBuilder]: At program point L3478(lines 3472 3480) the Hoare annotation is: true [2022-07-12 11:22:32,230 INFO L899 garLoopResultBuilder]: For program point L5241(lines 5241 5247) no Hoare annotation was computed. [2022-07-12 11:22:32,230 INFO L902 garLoopResultBuilder]: At program point L5672(lines 5671 5673) the Hoare annotation is: true [2022-07-12 11:22:32,230 INFO L902 garLoopResultBuilder]: At program point imon_initENTRY(lines 5234 5250) the Hoare annotation is: true [2022-07-12 11:22:32,230 INFO L899 garLoopResultBuilder]: For program point imon_initFINAL(lines 5234 5250) no Hoare annotation was computed. [2022-07-12 11:22:32,230 INFO L902 garLoopResultBuilder]: At program point L5504loopEntry(lines 5504 5523) the Hoare annotation is: true [2022-07-12 11:22:32,230 INFO L899 garLoopResultBuilder]: For program point L5513(lines 5513 5518) no Hoare annotation was computed. [2022-07-12 11:22:32,230 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 5500 5529) no Hoare annotation was computed. [2022-07-12 11:22:32,230 INFO L902 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 5500 5529) the Hoare annotation is: true [2022-07-12 11:22:32,230 INFO L899 garLoopResultBuilder]: For program point L5505(lines 5504 5523) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point L5524(lines 5500 5529) the Hoare annotation is: true [2022-07-12 11:22:32,231 INFO L899 garLoopResultBuilder]: For program point L5516-1(lines 5513 5518) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point L5516(line 5516) the Hoare annotation is: true [2022-07-12 11:22:32,231 INFO L899 garLoopResultBuilder]: For program point L5506(lines 5504 5523) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point L5508(line 5508) the Hoare annotation is: true [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point __create_pipeENTRY(lines 3515 3520) the Hoare annotation is: true [2022-07-12 11:22:32,231 INFO L899 garLoopResultBuilder]: For program point __create_pipeFINAL(lines 3515 3520) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L899 garLoopResultBuilder]: For program point __create_pipeEXIT(lines 3515 3520) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L899 garLoopResultBuilder]: For program point L3871-1(line 3871) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point L3871(line 3871) the Hoare annotation is: true [2022-07-12 11:22:32,231 INFO L899 garLoopResultBuilder]: For program point L3869-1(line 3869) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point L3869(line 3869) the Hoare annotation is: true [2022-07-12 11:22:32,231 INFO L899 garLoopResultBuilder]: For program point L3867-1(line 3867) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point L3867(line 3867) the Hoare annotation is: true [2022-07-12 11:22:32,231 INFO L899 garLoopResultBuilder]: For program point free_imon_contextEXIT(lines 3861 3902) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L899 garLoopResultBuilder]: For program point L3876(lines 3875 3896) no Hoare annotation was computed. [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point L3872(line 3872) the Hoare annotation is: true [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point free_imon_contextENTRY(lines 3861 3902) the Hoare annotation is: true [2022-07-12 11:22:32,231 INFO L902 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: true [2022-07-12 11:22:32,232 INFO L902 garLoopResultBuilder]: At program point L3872-1(lines 3872 3896) the Hoare annotation is: true [2022-07-12 11:22:32,232 INFO L902 garLoopResultBuilder]: At program point L3868(line 3868) the Hoare annotation is: true [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point L3868-1(line 3868) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L902 garLoopResultBuilder]: At program point L3897(lines 3861 3902) the Hoare annotation is: true [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point L3883(lines 3883 3889) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point L3879(line 3879) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 5569 5573) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5569 5573) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point L5571(line 5571) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5569 5573) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L902 garLoopResultBuilder]: At program point usb_alloc_urbENTRY(lines 5474 5498) the Hoare annotation is: true [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point usb_alloc_urbFINAL(lines 5474 5498) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point L5493(lines 5478 5494) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point L5482(line 5482) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point L5485(lines 5485 5488) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L902 garLoopResultBuilder]: At program point L5479loopEntry(lines 5479 5492) the Hoare annotation is: true [2022-07-12 11:22:32,232 INFO L902 garLoopResultBuilder]: At program point L5480(line 5480) the Hoare annotation is: true [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point usb_alloc_urbEXIT(lines 5474 5498) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L899 garLoopResultBuilder]: For program point L5023(lines 5022 5043) no Hoare annotation was computed. [2022-07-12 11:22:32,232 INFO L895 garLoopResultBuilder]: At program point L4858(line 4858) the Hoare annotation is: false [2022-07-12 11:22:32,233 INFO L895 garLoopResultBuilder]: At program point L4957(lines 4949 4958) the Hoare annotation is: false [2022-07-12 11:22:32,233 INFO L899 garLoopResultBuilder]: For program point L4858-1(line 4858) no Hoare annotation was computed. [2022-07-12 11:22:32,233 INFO L895 garLoopResultBuilder]: At program point L5387(lines 5294 5394) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-12 11:22:32,233 INFO L895 garLoopResultBuilder]: At program point L5222(line 5222) the Hoare annotation is: false [2022-07-12 11:22:32,233 INFO L895 garLoopResultBuilder]: At program point L5321(lines 5320 5380) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,233 INFO L895 garLoopResultBuilder]: At program point L5123(lines 5088 5133) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,233 INFO L899 garLoopResultBuilder]: For program point L5156-2(lines 5156 5162) no Hoare annotation was computed. [2022-07-12 11:22:32,233 INFO L899 garLoopResultBuilder]: For program point L5222-1(line 5222) no Hoare annotation was computed. [2022-07-12 11:22:32,233 INFO L899 garLoopResultBuilder]: For program point L5156(lines 5156 5162) no Hoare annotation was computed. [2022-07-12 11:22:32,233 INFO L899 garLoopResultBuilder]: For program point L4694(line 4694) no Hoare annotation was computed. [2022-07-12 11:22:32,233 INFO L895 garLoopResultBuilder]: At program point L5619(lines 5618 5620) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= (+ ~res_imon_probe_13~0 12) 0) (<= (+ |ULTIMATE.start_imon_probe_#res#1| 12) 0) (= ~ldv_urb_state~0 0) (<= (+ |ULTIMATE.start_imon_probe_~retval~6#1| 12) 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,233 INFO L895 garLoopResultBuilder]: At program point L4661(line 4661) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) (= |ULTIMATE.start_imon_probe_~context~7#1.base| 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0) (= |ULTIMATE.start_imon_probe_~context~7#1.offset| 0)) [2022-07-12 11:22:32,233 INFO L899 garLoopResultBuilder]: For program point L4661-1(line 4661) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5652(lines 5651 5653) the Hoare annotation is: false [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L5091(lines 5091 5133) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L4860-2(lines 4856 4890) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L4893(line 4893) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L4860(lines 4860 4863) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5554(lines 5553 5555) the Hoare annotation is: false [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L5323(lines 5323 5380) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L5224-1(line 5224) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5158(line 5158) the Hoare annotation is: false [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5224(line 5224) the Hoare annotation is: false [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L5026(line 5026) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L5158-1(line 5158) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5092(lines 5091 5133) the Hoare annotation is: false [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L4828(lines 4828 4834) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5324(lines 5323 5380) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5192-1(lines 5173 5194) the Hoare annotation is: false [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5225(lines 5225 5227) the Hoare annotation is: false [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L5225-1(lines 5225 5227) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5192(line 5192) the Hoare annotation is: false [2022-07-12 11:22:32,234 INFO L899 garLoopResultBuilder]: For program point L4928-1(line 4928) no Hoare annotation was computed. [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L4928(line 4928) the Hoare annotation is: false [2022-07-12 11:22:32,234 INFO L895 garLoopResultBuilder]: At program point L5622(lines 5621 5623) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L4664(lines 4664 4671) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L5094(lines 5094 5133) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L4896(lines 4896 4903) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L4698(lines 4698 4704) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L895 garLoopResultBuilder]: At program point L3575(lines 3555 3576) the Hoare annotation is: false [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L5326(lines 5326 5380) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L895 garLoopResultBuilder]: At program point L5095(lines 5070 5133) the Hoare annotation is: false [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L4930(lines 4930 4937) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L4996-2(lines 4996 4999) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L4996(lines 4996 4999) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L895 garLoopResultBuilder]: At program point L5327(lines 5326 5380) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,235 INFO L895 garLoopResultBuilder]: At program point L5393(lines 5286 5395) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L5228-1(line 5228) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L895 garLoopResultBuilder]: At program point L5228(line 5228) the Hoare annotation is: false [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L5030(lines 5030 5036) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L895 garLoopResultBuilder]: At program point L5658(line 5658) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L5658-1(line 5658) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L895 garLoopResultBuilder]: At program point L5658-2(lines 5657 5659) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,235 INFO L899 garLoopResultBuilder]: For program point L5196(line 5196) no Hoare annotation was computed. [2022-07-12 11:22:32,235 INFO L895 garLoopResultBuilder]: At program point L5097(lines 5073 5133) the Hoare annotation is: false [2022-07-12 11:22:32,236 INFO L899 garLoopResultBuilder]: For program point L4866(lines 4865 4886) no Hoare annotation was computed. [2022-07-12 11:22:32,239 INFO L899 garLoopResultBuilder]: For program point L4734(line 4734) no Hoare annotation was computed. [2022-07-12 11:22:32,239 INFO L899 garLoopResultBuilder]: For program point L4734-4(line 4734) no Hoare annotation was computed. [2022-07-12 11:22:32,239 INFO L899 garLoopResultBuilder]: For program point L4734-2(line 4734) no Hoare annotation was computed. [2022-07-12 11:22:32,239 INFO L899 garLoopResultBuilder]: For program point L4734-8(line 4734) no Hoare annotation was computed. [2022-07-12 11:22:32,239 INFO L895 garLoopResultBuilder]: At program point L3545loopEntry(lines 3545 3551) the Hoare annotation is: false [2022-07-12 11:22:32,239 INFO L899 garLoopResultBuilder]: For program point L4734-6(line 4734) no Hoare annotation was computed. [2022-07-12 11:22:32,239 INFO L895 garLoopResultBuilder]: At program point L5230(lines 5214 5232) the Hoare annotation is: false [2022-07-12 11:22:32,239 INFO L899 garLoopResultBuilder]: For program point L5329(lines 5329 5380) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5065(lines 4643 5139) the Hoare annotation is: false [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L4735(line 4735) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L4735-4(line 4735) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L4735-2(line 4735) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L3546(line 3546) the Hoare annotation is: false [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L4735-8(line 4735) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L4735-6(line 4735) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5330(lines 5329 5380) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5165(line 5165) the Hoare annotation is: false [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5132(lines 4643 5139) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ |ULTIMATE.start_imon_probe_~retval~6#1| 12) 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L5165-1(line 5165) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L4736(lines 4736 4811) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5298(line 5298) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5199(lines 5141 5201) the Hoare annotation is: false [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L5298-1(line 5298) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5067(lines 4643 5139) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 5)) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= 2 |ULTIMATE.start_imon_probe_~alloc_status~0#1|)) (.cse5 (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0)) (.cse6 (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 5) .cse3 .cse4 .cse5 .cse6) (and .cse1 (= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 1) .cse3 .cse6) (and .cse1 .cse3 .cse4 (<= (+ |ULTIMATE.start_imon_probe_~retval~6#1| 12) 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) .cse6 (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) .cse3 .cse4 .cse5 .cse6))) [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5001(line 5001) the Hoare annotation is: false [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L5001-1(line 5001) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L4869(line 4869) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L4737(lines 4737 4772) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5629(lines 5628 5630) the Hoare annotation is: false [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L5167(lines 5167 5172) no Hoare annotation was computed. [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5002(lines 5002 5004) the Hoare annotation is: false [2022-07-12 11:22:32,240 INFO L895 garLoopResultBuilder]: At program point L5101(lines 5076 5133) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,240 INFO L899 garLoopResultBuilder]: For program point L5167-2(lines 5167 5172) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L5002-1(lines 5002 5004) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L4738(lines 4738 4769) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L3582(lines 3582 3590) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L3582-2(lines 3582 3590) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L5300(lines 5300 5303) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L4673(line 4673) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L4673-1(line 4673) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L5136(line 5136) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L4905(line 4905) the Hoare annotation is: false [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L4905-1(line 4905) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L4939(line 4939) the Hoare annotation is: false [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L4939-1(line 4939) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L5005(line 5005) the Hoare annotation is: false [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L5005-1(line 5005) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L4774(lines 4736 4811) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) (.cse4 (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0))) (or (and .cse0 (<= |ULTIMATE.start_imon_probe_~ep_type~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (< |ULTIMATE.start_imon_probe_~ep_type~0#1| 3) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) .cse1 .cse2 (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) .cse3 .cse4) (and .cse0 (<= |ULTIMATE.start_imon_probe_~ep_dir~0#1| 0) .cse1 .cse2 .cse3 .cse4))) [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L4873(lines 4873 4879) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L4675(lines 4675 4679) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L3552(lines 3543 3600) the Hoare annotation is: false [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L5534(lines 5534 5539) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L4675-2(lines 4675 4679) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L5138(lines 4603 5140) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= (+ |ULTIMATE.start_imon_probe_#res#1| 12) 0) (= ~ldv_urb_state~0 0) (<= (+ |ULTIMATE.start_imon_probe_~retval~6#1| 12) 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L4973(line 4973) the Hoare annotation is: false [2022-07-12 11:22:32,241 INFO L899 garLoopResultBuilder]: For program point L4973-1(line 4973) no Hoare annotation was computed. [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L4775(lines 4736 4811) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) (.cse4 (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0))) (or (and .cse0 (<= |ULTIMATE.start_imon_probe_~ep_type~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (< |ULTIMATE.start_imon_probe_~ep_type~0#1| 3) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) .cse1 .cse2 (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) .cse3 .cse4) (and .cse0 (<= |ULTIMATE.start_imon_probe_~ep_dir~0#1| 0) .cse1 .cse2 .cse3 .cse4))) [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L4742loopEntry(lines 4742 4763) the Hoare annotation is: false [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L5601(lines 5600 5602) the Hoare annotation is: false [2022-07-12 11:22:32,241 INFO L895 garLoopResultBuilder]: At program point L5106(line 5106) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5007(lines 5007 5015) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5073(lines 5073 5133) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L4941(lines 4941 4948) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L4908(lines 4908 4915) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L4743(lines 4742 4763) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L4776(lines 4776 4809) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L5668(lines 5667 5669) the Hoare annotation is: false [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5173(lines 5173 5194) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L4777(lines 4777 4807) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L5537(line 5537) the Hoare annotation is: false [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5537-1(lines 5533 5547) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L5207(line 5207) the Hoare annotation is: false [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5207-1(line 5207) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5174(lines 5174 5189) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L4712(lines 4689 4713) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5307(line 5307) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5340(lines 5340 5343) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5076(lines 5076 5133) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L4977(lines 4977 4988) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L4746(line 4746) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L3524(lines 3521 3526) the Hoare annotation is: false [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L3557(line 3557) the Hoare annotation is: false [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L5176-1(line 5176) the Hoare annotation is: false [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L5110(lines 5079 5133) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L5209(line 5209) the Hoare annotation is: false [2022-07-12 11:22:32,242 INFO L899 garLoopResultBuilder]: For program point L5209-1(line 5209) no Hoare annotation was computed. [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L5176(line 5176) the Hoare annotation is: false [2022-07-12 11:22:32,242 INFO L895 garLoopResultBuilder]: At program point L5011(line 5011) the Hoare annotation is: false [2022-07-12 11:22:32,243 INFO L895 garLoopResultBuilder]: At program point L5044(lines 5021 5045) the Hoare annotation is: false [2022-07-12 11:22:32,243 INFO L899 garLoopResultBuilder]: For program point L5177(line 5177) no Hoare annotation was computed. [2022-07-12 11:22:32,243 INFO L895 garLoopResultBuilder]: At program point L4814(lines 4719 4815) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L4781loopEntry(lines 4781 4802) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= |ULTIMATE.start_imon_probe_~ep_dir~0#1| 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L3559(line 3559) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L5211(lines 5202 5213) the Hoare annotation is: false [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L5079(lines 5079 5133) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L5112(lines 5082 5133) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L4782(lines 4781 4802) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L4716(line 4716) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L5311(lines 5311 5316) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L5179(lines 5179 5184) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L4750(lines 4750 4756) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L5543(line 5543) the Hoare annotation is: false [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L5543-1(lines 5531 5548) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L5378(lines 5306 5381) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L4817(lines 4817 4846) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L4817-1(lines 4643 5139) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L3562loopEntry(lines 3562 3569) the Hoare annotation is: false [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L3595(lines 3595 3598) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L3595-2(lines 3595 3598) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L5313(lines 5313 5316) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L5313-1(lines 5311 5316) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L5148-1(line 5148) the Hoare annotation is: false [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L899 garLoopResultBuilder]: For program point L5082(lines 5082 5133) no Hoare annotation was computed. [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L5181(line 5181) the Hoare annotation is: false [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L5148(line 5148) the Hoare annotation is: false [2022-07-12 11:22:32,244 INFO L895 garLoopResultBuilder]: At program point L4950loopEntry(lines 4950 4956) the Hoare annotation is: false [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L4785(line 4785) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L5578(lines 5577 5579) the Hoare annotation is: false [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L3563(line 3563) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L3464(lines 3460 3466) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L5050(lines 5050 5056) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L5149(line 5149) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L5116(lines 5085 5133) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L4951(line 4951) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L5017(line 5017) the Hoare annotation is: false [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L5017-1(line 5017) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L4720-2(lines 4720 4813) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0)) (.cse4 (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0))) (or (and .cse0 (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) .cse1 .cse2 (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) .cse3 .cse4) (and .cse0 (<= |ULTIMATE.start_imon_probe_~ep_type~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= |ULTIMATE.start_imon_probe_~ep_dir~0#1| 0) .cse1 .cse2 .cse3 .cse4))) [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L4919(lines 4919 4926) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L4820loopEntry(lines 4820 4841) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L4721(lines 4720 4813) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L5382(lines 5305 5383) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L5019(lines 5019 5060) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L5019-1(lines 5019 5060) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L5085(lines 5085 5133) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L4821(lines 4820 4841) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L3599(lines 3535 3601) the Hoare annotation is: false [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L5581(lines 5580 5582) the Hoare annotation is: false [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L5152-1(line 5152) the Hoare annotation is: false [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L5152(line 5152) the Hoare annotation is: false [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L895 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: false [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-07-12 11:22:32,245 INFO L899 garLoopResultBuilder]: For program point L5020(lines 5020 5058) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L4723(lines 4723 4729) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L895 garLoopResultBuilder]: At program point L4690loopEntry(lines 4690 4711) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.offset| 0) (= ~ldv_urb_state~0 0) (<= |ULTIMATE.start_imon_probe_~alloc_status~0#1| 2) (= |ULTIMATE.start_imon_probe_~rx_urb~0#1.base| 0) (= |ULTIMATE.start_main_~ldv_s_imon_driver_usb_driver~0#1| 0) (= |ULTIMATE.start_imon_probe_~ir_ep_found~0#1| 0)) [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L4789(lines 4789 4795) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L4723-2(lines 4722 4732) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L895 garLoopResultBuilder]: At program point L3336(lines 3333 3338) the Hoare annotation is: false [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L5153(line 5153) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L5120(line 5120) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L895 garLoopResultBuilder]: At program point L4856-1(lines 4856 4891) the Hoare annotation is: false [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L4856(lines 4856 4891) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L4691(lines 4690 4711) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L4724(lines 4724 4727) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L895 garLoopResultBuilder]: At program point L5187(line 5187) the Hoare annotation is: false [2022-07-12 11:22:32,246 INFO L895 garLoopResultBuilder]: At program point L5022loopEntry(lines 5022 5043) the Hoare annotation is: false [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L5088(lines 5088 5133) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point L5320(lines 5320 5380) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point usb_kill_urbEXIT(lines 5660 5662) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L902 garLoopResultBuilder]: At program point usb_kill_urbENTRY(lines 5660 5662) the Hoare annotation is: true [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point usb_kill_urbFINAL(lines 5660 5662) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L902 garLoopResultBuilder]: At program point spinlock_checkENTRY(lines 3349 3354) the Hoare annotation is: true [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point spinlock_checkEXIT(lines 3349 3354) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point spinlock_checkFINAL(lines 3349 3354) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L902 garLoopResultBuilder]: At program point L5649(lines 5648 5650) the Hoare annotation is: true [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point imon_exitEXIT(lines 5252 5261) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L902 garLoopResultBuilder]: At program point imon_exitENTRY(lines 5252 5261) the Hoare annotation is: true [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point imon_exitFINAL(lines 5252 5261) no Hoare annotation was computed. [2022-07-12 11:22:32,246 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 5396 5401) the Hoare annotation is: true [2022-07-12 11:22:32,246 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 5396 5401) no Hoare annotation was computed. [2022-07-12 11:22:32,247 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 5396 5401) no Hoare annotation was computed. [2022-07-12 11:22:32,247 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5399) no Hoare annotation was computed. [2022-07-12 11:22:32,247 INFO L899 garLoopResultBuilder]: For program point L3611(lines 3611 3616) no Hoare annotation was computed. [2022-07-12 11:22:32,247 INFO L899 garLoopResultBuilder]: For program point L3608(lines 3608 3633) no Hoare annotation was computed. [2022-07-12 11:22:32,247 INFO L899 garLoopResultBuilder]: For program point L3611-2(lines 3611 3616) no Hoare annotation was computed. [2022-07-12 11:22:32,247 INFO L902 garLoopResultBuilder]: At program point L5557(lines 5556 5558) the Hoare annotation is: true [2022-07-12 11:22:32,247 INFO L899 garLoopResultBuilder]: For program point lirc_buffer_freeEXIT(lines 3602 3636) no Hoare annotation was computed. [2022-07-12 11:22:32,247 INFO L902 garLoopResultBuilder]: At program point lirc_buffer_freeENTRY(lines 3602 3636) the Hoare annotation is: true [2022-07-12 11:22:32,247 INFO L899 garLoopResultBuilder]: For program point L3623(lines 3623 3629) no Hoare annotation was computed. [2022-07-12 11:22:32,247 INFO L899 garLoopResultBuilder]: For program point L3623-2(lines 3602 3636) no Hoare annotation was computed. [2022-07-12 11:22:32,249 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:32,251 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:22:32,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:22:32 BoogieIcfgContainer [2022-07-12 11:22:32,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:22:32,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:22:32,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:22:32,288 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:22:32,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:22:03" (3/4) ... [2022-07-12 11:22:32,291 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 11:22:32,295 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2022-07-12 11:22:32,295 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-07-12 11:22:32,295 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2022-07-12 11:22:32,295 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_submit_urb [2022-07-12 11:22:32,295 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_match_id [2022-07-12 11:22:32,295 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2022-07-12 11:22:32,295 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-07-12 11:22:32,295 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure deregister_from_lirc [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock_nested [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __init_waitqueue_head [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure imon_init [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_imon_context [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-12 11:22:32,296 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2022-07-12 11:22:32,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_kill_urb [2022-07-12 11:22:32,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2022-07-12 11:22:32,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure imon_exit [2022-07-12 11:22:32,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-07-12 11:22:32,297 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lirc_buffer_free [2022-07-12 11:22:32,314 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 183 nodes and edges [2022-07-12 11:22:32,317 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2022-07-12 11:22:32,318 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-12 11:22:32,320 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 11:22:32,321 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-12 11:22:32,322 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 11:22:32,323 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 11:22:32,324 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 11:22:32,355 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0 && \result + 12 <= 0) && ldv_urb_state == 0) && retval + 12 <= 0) && ldv_s_imon_driver_usb_driver == 0 [2022-07-12 11:22:32,356 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_coherent_state == 0 && res_imon_probe_13 + 12 <= 0) && \result + 12 <= 0) && ldv_urb_state == 0) && retval + 12 <= 0) && ldv_s_imon_driver_usb_driver == 0 [2022-07-12 11:22:32,460 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 11:22:32,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:22:32,460 INFO L158 Benchmark]: Toolchain (without parser) took 31790.20ms. Allocated memory was 113.2MB in the beginning and 566.2MB in the end (delta: 453.0MB). Free memory was 71.3MB in the beginning and 281.1MB in the end (delta: -209.8MB). Peak memory consumption was 239.5MB. Max. memory is 16.1GB. [2022-07-12 11:22:32,461 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory was 45.7MB in the beginning and 45.7MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:22:32,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1048.05ms. Allocated memory was 113.2MB in the beginning and 148.9MB in the end (delta: 35.7MB). Free memory was 71.1MB in the beginning and 96.9MB in the end (delta: -25.8MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2022-07-12 11:22:32,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.38ms. Allocated memory is still 148.9MB. Free memory was 96.3MB in the beginning and 87.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 11:22:32,461 INFO L158 Benchmark]: Boogie Preprocessor took 99.97ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 77.3MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 11:22:32,461 INFO L158 Benchmark]: RCFGBuilder took 1545.07ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 77.3MB in the beginning and 130.5MB in the end (delta: -53.2MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2022-07-12 11:22:32,461 INFO L158 Benchmark]: TraceAbstraction took 28796.03ms. Allocated memory was 186.6MB in the beginning and 566.2MB in the end (delta: 379.6MB). Free memory was 130.5MB in the beginning and 314.7MB in the end (delta: -184.1MB). Peak memory consumption was 349.6MB. Max. memory is 16.1GB. [2022-07-12 11:22:32,462 INFO L158 Benchmark]: Witness Printer took 172.21ms. Allocated memory is still 566.2MB. Free memory was 314.7MB in the beginning and 281.1MB in the end (delta: 33.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-12 11:22:32,463 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory was 45.7MB in the beginning and 45.7MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1048.05ms. Allocated memory was 113.2MB in the beginning and 148.9MB in the end (delta: 35.7MB). Free memory was 71.1MB in the beginning and 96.9MB in the end (delta: -25.8MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.38ms. Allocated memory is still 148.9MB. Free memory was 96.3MB in the beginning and 87.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.97ms. Allocated memory is still 148.9MB. Free memory was 87.0MB in the beginning and 77.3MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1545.07ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 77.3MB in the beginning and 130.5MB in the end (delta: -53.2MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28796.03ms. Allocated memory was 186.6MB in the beginning and 566.2MB in the end (delta: 379.6MB). Free memory was 130.5MB in the beginning and 314.7MB in the end (delta: -184.1MB). Peak memory consumption was 349.6MB. Max. memory is 16.1GB. * Witness Printer took 172.21ms. Allocated memory is still 566.2MB. Free memory was 314.7MB in the beginning and 281.1MB in the end (delta: 33.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 5399]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 26 procedures, 350 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.7s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5748 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5199 mSDsluCounter, 25322 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15260 mSDsCounter, 1144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4035 IncrementalHoareTripleChecker+Invalid, 5179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1144 mSolverCounterUnsat, 10062 mSDtfsCounter, 4035 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3495 GetRequests, 3311 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1392occurred in iteration=18, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 2770 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 146 LocationsWithAnnotation, 3544 PreInvPairs, 3598 NumberOfFragments, 935 HoareAnnotationTreeSize, 3544 FomulaSimplifications, 372 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 146 FomulaSimplificationsInter, 267799 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 5127 NumberOfCodeBlocks, 5127 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 5285 ConstructedInterpolants, 0 QuantifiedInterpolants, 9083 SizeOfPredicates, 5 NumberOfNonLiveVariables, 45261 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 36 InterpolantComputations, 20 PerfectInterpolantSequences, 2280/2567 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5305]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3555]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5667]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5202]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5088]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 5323]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 5618]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && res_imon_probe_13 + 12 <= 0) && \result + 12 <= 0) && ldv_urb_state == 0) && retval + 12 <= 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 5574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3535]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5082]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 5531]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3521]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5022]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 4949]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5141]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5651]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4643]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && retval + 12 <= 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 4720]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && rx_urb == 0) && ldv_urb_state == 0) && alloc_status <= 2) && rx_urb == 0) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0) || (((((ldv_coherent_state == 0 && ep_type <= 0) && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0)) || (((((ldv_coherent_state == 0 && ep_dir <= 0) && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0) - InvariantResult [Line: 5286]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 5553]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 4781]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && ep_dir <= 0) && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0 - InvariantResult [Line: 5329]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 4820]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0 - InvariantResult [Line: 4950]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5091]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5021]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5214]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5556]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3872]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4643]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0 - InvariantResult [Line: 4719]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0 - InvariantResult [Line: 4736]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && ep_type <= 0) && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0) || (((((((ldv_coherent_state == 0 && ep_type < 3) && rx_urb == 0) && ldv_urb_state == 0) && alloc_status <= 2) && rx_urb == 0) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0)) || (((((ldv_coherent_state == 0 && ep_dir <= 0) && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0) - InvariantResult [Line: 5577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3333]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5076]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 3460]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && rx_urb == 0) && ldv_urb_state == 0) && alloc_status <= 2) && rx_urb == 0) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0 - InvariantResult [Line: 5580]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5326]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 5479]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5500]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5320]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 5294]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5648]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4690]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && rx_urb == 0) && ldv_urb_state == 0) && alloc_status <= 2) && rx_urb == 0) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0 - InvariantResult [Line: 4742]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5073]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 4856]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5085]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 5657]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && rx_urb == 0) && ldv_urb_state == 0) && alloc_status <= 2) && rx_urb == 0) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0 - InvariantResult [Line: 5306]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 5504]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4603]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && \result + 12 <= 0) && ldv_urb_state == 0) && retval + 12 <= 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 5600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3545]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5621]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4736]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && ep_type <= 0) && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0) || (((((((ldv_coherent_state == 0 && ep_type < 3) && rx_urb == 0) && ldv_urb_state == 0) && alloc_status <= 2) && rx_urb == 0) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0)) || (((((ldv_coherent_state == 0 && ep_dir <= 0) && ldv_urb_state == 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0) - InvariantResult [Line: 5671]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4643]: Loop Invariant Derived loop invariant: (((((((((alloc_status <= 5 && ldv_coherent_state == 0) && rx_urb == 0) && alloc_status == 5) && ldv_urb_state == 0) && 2 <= alloc_status) && rx_urb == 0) && ldv_s_imon_driver_usb_driver == 0) || (((ldv_coherent_state == 0 && alloc_status == 1) && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0)) || ((((((ldv_coherent_state == 0 && ldv_urb_state == 0) && 2 <= alloc_status) && retval + 12 <= 0) && alloc_status <= 2) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0)) || (((((((alloc_status <= 5 && ldv_coherent_state == 0) && rx_urb == 0) && alloc_status == 2) && ldv_urb_state == 0) && 2 <= alloc_status) && rx_urb == 0) && ldv_s_imon_driver_usb_driver == 0) - InvariantResult [Line: 5628]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5070]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3562]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3861]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5079]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_imon_driver_usb_driver == 0 - InvariantResult [Line: 4689]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && rx_urb == 0) && ldv_urb_state == 0) && alloc_status <= 2) && rx_urb == 0) && ldv_s_imon_driver_usb_driver == 0) && ir_ep_found == 0 - InvariantResult [Line: 5632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5603]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4643]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3543]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-07-12 11:22:32,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE