./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 f4b24e32 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-?-f4b24e3 [2022-07-13 23:02:47,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:02:47,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:02:47,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:02:47,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:02:47,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:02:47,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:02:47,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:02:47,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:02:47,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:02:47,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:02:47,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:02:47,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:02:47,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:02:47,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:02:47,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:02:47,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:02:47,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:02:47,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:02:47,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:02:47,561 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:02:47,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:02:47,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:02:47,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:02:47,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:02:47,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:02:47,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:02:47,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:02:47,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:02:47,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:02:47,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:02:47,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:02:47,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:02:47,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:02:47,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:02:47,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:02:47,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:02:47,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:02:47,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:02:47,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:02:47,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:02:47,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:02:47,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 23:02:47,595 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:02:47,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:02:47,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:02:47,596 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:02:47,597 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:02:47,597 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:02:47,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:02:47,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:02:47,598 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:02:47,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:02:47,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 23:02:47,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:02:47,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:02:47,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:02:47,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:02:47,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:02:47,599 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:02:47,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:02:47,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:02:47,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:02:47,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:02:47,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:02:47,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:02:47,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:02:47,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:02:47,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 23:02:47,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 23:02:47,601 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:02:47,601 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:02:47,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:02:47,602 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-13 23:02:47,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:02:47,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:02:47,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:02:47,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:02:47,825 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:02:47,826 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-13 23:02:47,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369157051/29f18d8b86e24b9d8ba444b72b201797/FLAGe55ca988b [2022-07-13 23:02:48,550 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:02:48,554 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-13 23:02:48,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369157051/29f18d8b86e24b9d8ba444b72b201797/FLAGe55ca988b [2022-07-13 23:02:48,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369157051/29f18d8b86e24b9d8ba444b72b201797 [2022-07-13 23:02:48,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:02:48,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:02:48,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:02:48,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:02:48,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:02:48,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:02:48" (1/1) ... [2022-07-13 23:02:48,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca5d2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:48, skipping insertion in model container [2022-07-13 23:02:48,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:02:48" (1/1) ... [2022-07-13 23:02:48,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:02:48,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:02:49,780 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-13 23:02:49,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:02:49,838 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:02:50,072 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-13 23:02:50,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:02:50,136 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:02:50,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50 WrapperNode [2022-07-13 23:02:50,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:02:50,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:02:50,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:02:50,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:02:50,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,284 INFO L137 Inliner]: procedures = 121, calls = 866, calls flagged for inlining = 46, calls inlined = 30, statements flattened = 1605 [2022-07-13 23:02:50,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:02:50,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:02:50,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:02:50,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:02:50,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:02:50,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:02:50,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:02:50,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:02:50,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (1/1) ... [2022-07-13 23:02:50,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:02:50,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:50,461 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-13 23:02:50,480 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-13 23:02:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 23:02:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-13 23:02:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-13 23:02:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-13 23:02:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-13 23:02:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure usb_match_id [2022-07-13 23:02:50,498 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_match_id [2022-07-13 23:02:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 23:02:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure imon_init [2022-07-13 23:02:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure imon_init [2022-07-13 23:02:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-13 23:02:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-13 23:02:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:02:50,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:02:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-13 23:02:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-13 23:02:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure imon_exit [2022-07-13 23:02:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure imon_exit [2022-07-13 23:02:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-07-13 23:02:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-07-13 23:02:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 23:02:50,500 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 23:02:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 23:02:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-13 23:02:50,501 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-13 23:02:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-13 23:02:50,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-13 23:02:50,501 INFO L130 BoogieDeclarations]: Found specification of procedure free_imon_context [2022-07-13 23:02:50,501 INFO L138 BoogieDeclarations]: Found implementation of procedure free_imon_context [2022-07-13 23:02:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:02:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-13 23:02:50,502 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-13 23:02:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure lirc_buffer_free [2022-07-13 23:02:50,502 INFO L138 BoogieDeclarations]: Found implementation of procedure lirc_buffer_free [2022-07-13 23:02:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:02:50,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:02:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:02:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure deregister_from_lirc [2022-07-13 23:02:50,503 INFO L138 BoogieDeclarations]: Found implementation of procedure deregister_from_lirc [2022-07-13 23:02:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:02:50,503 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-13 23:02:50,504 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-13 23:02:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-13 23:02:50,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-13 23:02:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:02:50,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:02:50,505 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-13 23:02:50,505 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-13 23:02:50,505 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-13 23:02:50,505 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-13 23:02:50,505 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-13 23:02:50,505 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-13 23:02:50,505 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-13 23:02:50,506 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-13 23:02:50,506 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-13 23:02:50,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-13 23:02:50,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-13 23:02:50,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-13 23:02:50,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 23:02:50,508 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-13 23:02:50,509 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-13 23:02:50,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:02:50,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:02:50,830 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:02:50,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:02:51,079 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-13 23:02:51,247 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:02:52,257 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume !false; [2022-07-13 23:02:52,258 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume false; [2022-07-13 23:02:52,284 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:02:52,299 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:02:52,300 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2022-07-13 23:02:52,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:52 BoogieIcfgContainer [2022-07-13 23:02:52,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:02:52,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:02:52,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:02:52,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:02:52,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:02:48" (1/3) ... [2022-07-13 23:02:52,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d7df58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:02:52, skipping insertion in model container [2022-07-13 23:02:52,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:50" (2/3) ... [2022-07-13 23:02:52,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d7df58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:02:52, skipping insertion in model container [2022-07-13 23:02:52,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:52" (3/3) ... [2022-07-13 23:02:52,312 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-staging-lirc-lirc_imon.ko.cil.out.i [2022-07-13 23:02:52,325 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:02:52,325 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:02:52,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:02:52,409 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@5eb76c1b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1df19c46 [2022-07-13 23:02:52,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:02:52,418 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-13 23:02:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 23:02:52,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:52,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:52,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1796219403, now seen corresponding path program 1 times [2022-07-13 23:02:52,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:52,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334919305] [2022-07-13 23:02:52,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:52,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:52,998 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-13 23:02:52,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:52,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334919305] [2022-07-13 23:02:53,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334919305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:53,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:53,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:02:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100428910] [2022-07-13 23:02:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:53,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:02:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:02:53,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:02:53,046 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-13 23:02:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:53,215 INFO L93 Difference]: Finished difference Result 1009 states and 1523 transitions. [2022-07-13 23:02:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:02:53,220 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-13 23:02:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:53,242 INFO L225 Difference]: With dead ends: 1009 [2022-07-13 23:02:53,243 INFO L226 Difference]: Without dead ends: 664 [2022-07-13 23:02:53,252 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-13 23:02:53,257 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-13 23:02:53,258 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-13 23:02:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-07-13 23:02:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2022-07-13 23:02:53,363 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-13 23:02:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 876 transitions. [2022-07-13 23:02:53,370 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 876 transitions. Word has length 16 [2022-07-13 23:02:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:53,371 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 876 transitions. [2022-07-13 23:02:53,371 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-13 23:02:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 876 transitions. [2022-07-13 23:02:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 23:02:53,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:53,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:53,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 23:02:53,373 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:53,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash 151566468, now seen corresponding path program 1 times [2022-07-13 23:02:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:53,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313102403] [2022-07-13 23:02:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,568 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-13 23:02:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:53,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313102403] [2022-07-13 23:02:53,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313102403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:53,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:53,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:02:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55469164] [2022-07-13 23:02:53,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:53,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:02:53,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:53,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:02:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:02:53,572 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-13 23:02:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:53,609 INFO L93 Difference]: Finished difference Result 663 states and 877 transitions. [2022-07-13 23:02:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:02:53,609 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-13 23:02:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:53,619 INFO L225 Difference]: With dead ends: 663 [2022-07-13 23:02:53,619 INFO L226 Difference]: Without dead ends: 652 [2022-07-13 23:02:53,621 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-13 23:02:53,624 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-13 23:02:53,624 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-13 23:02:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-07-13 23:02:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2022-07-13 23:02:53,665 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-13 23:02:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 863 transitions. [2022-07-13 23:02:53,671 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 863 transitions. Word has length 17 [2022-07-13 23:02:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:53,671 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-13 23:02:53,671 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-13 23:02:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 863 transitions. [2022-07-13 23:02:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 23:02:53,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:53,673 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-13 23:02:53,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 23:02:53,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:53,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash -785836700, now seen corresponding path program 1 times [2022-07-13 23:02:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:53,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928358523] [2022-07-13 23:02:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,920 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-13 23:02:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:53,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928358523] [2022-07-13 23:02:53,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928358523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:53,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:53,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:02:53,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101947515] [2022-07-13 23:02:53,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:53,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:02:53,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:53,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:02:53,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:02:53,937 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-13 23:02:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:54,494 INFO L93 Difference]: Finished difference Result 1480 states and 2016 transitions. [2022-07-13 23:02:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:02:54,494 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-13 23:02:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:54,500 INFO L225 Difference]: With dead ends: 1480 [2022-07-13 23:02:54,500 INFO L226 Difference]: Without dead ends: 840 [2022-07-13 23:02:54,502 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-13 23:02:54,503 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 154 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1155 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.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:54,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1155 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 23:02:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-07-13 23:02:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 666. [2022-07-13 23:02:54,538 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-13 23:02:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 877 transitions. [2022-07-13 23:02:54,541 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 877 transitions. Word has length 45 [2022-07-13 23:02:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:54,542 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 877 transitions. [2022-07-13 23:02:54,543 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-13 23:02:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 877 transitions. [2022-07-13 23:02:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-13 23:02:54,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:54,546 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-13 23:02:54,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 23:02:54,547 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:54,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash 156110253, now seen corresponding path program 1 times [2022-07-13 23:02:54,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:54,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844012407] [2022-07-13 23:02:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:54,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:02:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 23:02:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:02:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:02:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:02:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:02:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,747 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-13 23:02:54,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:54,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844012407] [2022-07-13 23:02:54,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844012407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:54,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:54,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:02:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018567103] [2022-07-13 23:02:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:54,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:02:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:02:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:02:54,750 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-13 23:02:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:55,179 INFO L93 Difference]: Finished difference Result 1392 states and 1856 transitions. [2022-07-13 23:02:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:02:55,180 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-13 23:02:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:55,183 INFO L225 Difference]: With dead ends: 1392 [2022-07-13 23:02:55,184 INFO L226 Difference]: Without dead ends: 737 [2022-07-13 23:02:55,185 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-13 23:02:55,186 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 267 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 816 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:55,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 816 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 23:02:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-07-13 23:02:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 691. [2022-07-13 23:02:55,225 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-13 23:02:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 911 transitions. [2022-07-13 23:02:55,230 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 911 transitions. Word has length 81 [2022-07-13 23:02:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:55,230 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 911 transitions. [2022-07-13 23:02:55,230 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-13 23:02:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 911 transitions. [2022-07-13 23:02:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-13 23:02:55,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:55,237 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-13 23:02:55,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 23:02:55,238 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:55,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:55,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1773089863, now seen corresponding path program 1 times [2022-07-13 23:02:55,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:55,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332630430] [2022-07-13 23:02:55,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:55,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:02:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:02:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:02:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:55,657 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-13 23:02:55,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:55,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332630430] [2022-07-13 23:02:55,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332630430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:55,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534256732] [2022-07-13 23:02:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:55,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:55,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:55,663 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-13 23:02:55,692 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-13 23:02:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 2443 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:02:56,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:56,249 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-13 23:02:56,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:56,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534256732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:56,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:56,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-13 23:02:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541045781] [2022-07-13 23:02:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:56,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:02:56,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:02:56,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:02:56,252 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-13 23:02:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:56,314 INFO L93 Difference]: Finished difference Result 1547 states and 2086 transitions. [2022-07-13 23:02:56,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:02:56,314 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-13 23:02:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:56,319 INFO L225 Difference]: With dead ends: 1547 [2022-07-13 23:02:56,319 INFO L226 Difference]: Without dead ends: 868 [2022-07-13 23:02:56,320 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-13 23:02:56,321 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-13 23:02:56,322 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-13 23:02:56,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-07-13 23:02:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 703. [2022-07-13 23:02:56,372 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-13 23:02:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 925 transitions. [2022-07-13 23:02:56,377 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 925 transitions. Word has length 80 [2022-07-13 23:02:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:56,379 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 925 transitions. [2022-07-13 23:02:56,379 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-13 23:02:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 925 transitions. [2022-07-13 23:02:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 23:02:56,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:56,382 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-13 23:02:56,413 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-13 23:02:56,595 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-13 23:02:56,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1761414966, now seen corresponding path program 1 times [2022-07-13 23:02:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:56,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629743462] [2022-07-13 23:02:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:02:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:02:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:02:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:02:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:02:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:56,944 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-13 23:02:56,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:56,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629743462] [2022-07-13 23:02:56,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629743462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:56,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407821891] [2022-07-13 23:02:56,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:56,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:56,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:56,947 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-13 23:02:56,979 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-13 23:02:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:02:57,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:57,603 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-13 23:02:57,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:57,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407821891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:57,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:57,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-13 23:02:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711684015] [2022-07-13 23:02:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:57,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:02:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:57,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:02:57,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:02:57,607 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-13 23:02:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:57,685 INFO L93 Difference]: Finished difference Result 1571 states and 2114 transitions. [2022-07-13 23:02:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:02:57,685 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-13 23:02:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:57,691 INFO L225 Difference]: With dead ends: 1571 [2022-07-13 23:02:57,691 INFO L226 Difference]: Without dead ends: 880 [2022-07-13 23:02:57,693 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-13 23:02:57,696 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-13 23:02:57,697 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-13 23:02:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-13 23:02:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 711. [2022-07-13 23:02:57,725 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-13 23:02:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 933 transitions. [2022-07-13 23:02:57,729 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 933 transitions. Word has length 112 [2022-07-13 23:02:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:57,729 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 933 transitions. [2022-07-13 23:02:57,730 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-13 23:02:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 933 transitions. [2022-07-13 23:02:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 23:02:57,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:57,732 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-13 23:02:57,763 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-13 23:02:57,955 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-13 23:02:57,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash -616076705, now seen corresponding path program 1 times [2022-07-13 23:02:57,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:57,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626439635] [2022-07-13 23:02:57,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:02:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:02:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:02:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 23:02:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 23:02:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:02:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 23:02:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 23:02:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,241 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-13 23:02:58,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:58,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626439635] [2022-07-13 23:02:58,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626439635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:58,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952233830] [2022-07-13 23:02:58,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:58,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:58,244 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-13 23:02:58,246 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-13 23:02:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 23:02:58,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:58,899 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-13 23:02:58,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:58,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952233830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:58,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:58,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-13 23:02:58,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013970937] [2022-07-13 23:02:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:58,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:02:58,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:58,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:02:58,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:02:58,903 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-13 23:02:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:58,943 INFO L93 Difference]: Finished difference Result 1414 states and 1857 transitions. [2022-07-13 23:02:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:02:58,944 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-13 23:02:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:58,947 INFO L225 Difference]: With dead ends: 1414 [2022-07-13 23:02:58,947 INFO L226 Difference]: Without dead ends: 711 [2022-07-13 23:02:58,951 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-13 23:02:58,953 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-13 23:02:58,953 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-13 23:02:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-07-13 23:02:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2022-07-13 23:02:58,980 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-13 23:02:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 932 transitions. [2022-07-13 23:02:58,983 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 932 transitions. Word has length 121 [2022-07-13 23:02:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:58,984 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 932 transitions. [2022-07-13 23:02:58,984 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-13 23:02:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 932 transitions. [2022-07-13 23:02:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 23:02:58,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:58,987 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-13 23:02:59,018 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-13 23:02:59,203 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-13 23:02:59,203 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1762617218, now seen corresponding path program 1 times [2022-07-13 23:02:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:59,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905702630] [2022-07-13 23:02:59,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:59,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:02:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:02:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:02:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:02:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 23:02:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 23:02:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:02:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 23:02:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 23:02:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:59,500 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-13 23:02:59,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:59,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905702630] [2022-07-13 23:02:59,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905702630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:59,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434708492] [2022-07-13 23:02:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:59,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:59,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:59,503 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-13 23:02:59,505 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-13 23:03:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 2605 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 23:03:00,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:00,150 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-13 23:03:00,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:00,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434708492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:00,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:00,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-13 23:03:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646214844] [2022-07-13 23:03:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:00,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:03:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:00,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:03:00,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:03:00,152 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-13 23:03:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:00,307 INFO L93 Difference]: Finished difference Result 1456 states and 1910 transitions. [2022-07-13 23:03:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:03:00,308 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-13 23:03:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:00,311 INFO L225 Difference]: With dead ends: 1456 [2022-07-13 23:03:00,312 INFO L226 Difference]: Without dead ends: 734 [2022-07-13 23:03:00,314 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-13 23:03:00,315 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-13 23:03:00,315 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-13 23:03:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-07-13 23:03:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 712. [2022-07-13 23:03:00,342 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-13 23:03:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 924 transitions. [2022-07-13 23:03:00,346 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 924 transitions. Word has length 121 [2022-07-13 23:03:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:00,346 INFO L495 AbstractCegarLoop]: Abstraction has 712 states and 924 transitions. [2022-07-13 23:03:00,347 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-13 23:03:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 924 transitions. [2022-07-13 23:03:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 23:03:00,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:00,348 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-13 23:03:00,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 23:03:00,575 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-13 23:03:00,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:00,576 INFO L85 PathProgramCache]: Analyzing trace with hash -267357553, now seen corresponding path program 1 times [2022-07-13 23:03:00,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:00,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768791223] [2022-07-13 23:03:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:00,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:03:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:03:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:03:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 23:03:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,991 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-13 23:03:00,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:00,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768791223] [2022-07-13 23:03:00,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768791223] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:00,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358294399] [2022-07-13 23:03:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:00,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:00,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:00,993 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-13 23:03:00,995 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-13 23:03:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:01,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:01,666 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-13 23:03:01,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:01,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358294399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:01,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:01,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-13 23:03:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001312404] [2022-07-13 23:03:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:01,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:01,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:03:01,669 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-13 23:03:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:01,733 INFO L93 Difference]: Finished difference Result 947 states and 1262 transitions. [2022-07-13 23:03:01,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:01,734 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-13 23:03:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:01,738 INFO L225 Difference]: With dead ends: 947 [2022-07-13 23:03:01,739 INFO L226 Difference]: Without dead ends: 891 [2022-07-13 23:03:01,739 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-13 23:03:01,740 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-13 23:03:01,740 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-13 23:03:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-07-13 23:03:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 715. [2022-07-13 23:03:01,771 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-13 23:03:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 927 transitions. [2022-07-13 23:03:01,774 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 927 transitions. Word has length 135 [2022-07-13 23:03:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:01,776 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 927 transitions. [2022-07-13 23:03:01,776 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-13 23:03:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 927 transitions. [2022-07-13 23:03:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 23:03:01,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:01,778 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-13 23:03:01,807 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-13 23:03:01,991 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-13 23:03:01,992 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash 238024164, now seen corresponding path program 1 times [2022-07-13 23:03:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:01,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213462394] [2022-07-13 23:03:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:03:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:03:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:03:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 23:03:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 23:03:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,364 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-13 23:03:02,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:02,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213462394] [2022-07-13 23:03:02,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213462394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:02,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207878540] [2022-07-13 23:03:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:02,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:02,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:02,367 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-13 23:03:02,368 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-13 23:03:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:03,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:03,099 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-13 23:03:03,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:03,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207878540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:03,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:03,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 23:03:03,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687414377] [2022-07-13 23:03:03,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:03,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:03:03,105 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-13 23:03:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:03,174 INFO L93 Difference]: Finished difference Result 952 states and 1269 transitions. [2022-07-13 23:03:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:03,174 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-13 23:03:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:03,179 INFO L225 Difference]: With dead ends: 952 [2022-07-13 23:03:03,179 INFO L226 Difference]: Without dead ends: 896 [2022-07-13 23:03:03,180 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-13 23:03:03,181 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-13 23:03:03,182 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-13 23:03:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-13 23:03:03,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 717. [2022-07-13 23:03:03,215 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-13 23:03:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 929 transitions. [2022-07-13 23:03:03,218 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 929 transitions. Word has length 153 [2022-07-13 23:03:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:03,218 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 929 transitions. [2022-07-13 23:03:03,219 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-13 23:03:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 929 transitions. [2022-07-13 23:03:03,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-13 23:03:03,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:03,221 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-13 23:03:03,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:03,437 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-13 23:03:03,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:03,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1047500121, now seen corresponding path program 1 times [2022-07-13 23:03:03,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:03,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939784615] [2022-07-13 23:03:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:03,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:03:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:03:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:03:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 23:03:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 23:03:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 23:03:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,925 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-13 23:03:03,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:03,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939784615] [2022-07-13 23:03:03,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939784615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:03,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560459530] [2022-07-13 23:03:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:03,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:03,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:03,928 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-13 23:03:03,929 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-13 23:03:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:04,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 2923 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:04,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:04,642 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-13 23:03:04,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:04,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560459530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:04,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:04,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 23:03:04,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392491226] [2022-07-13 23:03:04,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:04,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:03:04,645 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-13 23:03:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:04,717 INFO L93 Difference]: Finished difference Result 956 states and 1274 transitions. [2022-07-13 23:03:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:04,717 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-13 23:03:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:04,722 INFO L225 Difference]: With dead ends: 956 [2022-07-13 23:03:04,722 INFO L226 Difference]: Without dead ends: 900 [2022-07-13 23:03:04,723 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-13 23:03:04,724 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-13 23:03:04,724 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-13 23:03:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-07-13 23:03:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 719. [2022-07-13 23:03:04,770 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-13 23:03:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 931 transitions. [2022-07-13 23:03:04,774 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 931 transitions. Word has length 171 [2022-07-13 23:03:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:04,774 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 931 transitions. [2022-07-13 23:03:04,774 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-13 23:03:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 931 transitions. [2022-07-13 23:03:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-13 23:03:04,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:04,779 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-13 23:03:04,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:04,995 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-13 23:03:04,996 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash 674277908, now seen corresponding path program 1 times [2022-07-13 23:03:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:04,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720504710] [2022-07-13 23:03:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:03:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:03:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:03:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 23:03:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 23:03:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 23:03:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:05,375 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-13 23:03:05,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:05,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720504710] [2022-07-13 23:03:05,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720504710] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:05,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071415339] [2022-07-13 23:03:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:05,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:05,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:05,380 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-13 23:03:05,381 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-13 23:03:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 2924 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:03:06,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:06,155 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-13 23:03:06,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:06,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071415339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:06,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:06,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 23:03:06,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101793916] [2022-07-13 23:03:06,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:06,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:06,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:06,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:06,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:03:06,159 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-13 23:03:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:06,220 INFO L93 Difference]: Finished difference Result 1647 states and 2176 transitions. [2022-07-13 23:03:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:06,220 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-13 23:03:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:06,225 INFO L225 Difference]: With dead ends: 1647 [2022-07-13 23:03:06,241 INFO L226 Difference]: Without dead ends: 940 [2022-07-13 23:03:06,243 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-13 23:03:06,243 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-13 23:03:06,244 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-13 23:03:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-07-13 23:03:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 779. [2022-07-13 23:03:06,284 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-13 23:03:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1009 transitions. [2022-07-13 23:03:06,287 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1009 transitions. Word has length 172 [2022-07-13 23:03:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:06,288 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1009 transitions. [2022-07-13 23:03:06,288 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-13 23:03:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1009 transitions. [2022-07-13 23:03:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-13 23:03:06,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:06,290 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-13 23:03:06,321 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-13 23:03:06,507 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-13 23:03:06,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1219298443, now seen corresponding path program 1 times [2022-07-13 23:03:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:06,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849016204] [2022-07-13 23:03:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:03:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 23:03:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 23:03:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 23:03:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 23:03:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 23:03:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 23:03:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:03:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,839 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-13 23:03:06,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:06,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849016204] [2022-07-13 23:03:06,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849016204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:06,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246463631] [2022-07-13 23:03:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:06,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:06,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:06,841 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-13 23:03:06,843 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-13 23:03:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 2767 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:07,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:07,521 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-13 23:03:07,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:07,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246463631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:07,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:07,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-13 23:03:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292655764] [2022-07-13 23:03:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:07,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:07,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:03:07,524 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-13 23:03:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:07,618 INFO L93 Difference]: Finished difference Result 1721 states and 2265 transitions. [2022-07-13 23:03:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:07,618 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-13 23:03:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:07,622 INFO L225 Difference]: With dead ends: 1721 [2022-07-13 23:03:07,623 INFO L226 Difference]: Without dead ends: 939 [2022-07-13 23:03:07,625 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-13 23:03:07,625 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-13 23:03:07,626 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-13 23:03:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-13 23:03:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 780. [2022-07-13 23:03:07,665 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-13 23:03:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1005 transitions. [2022-07-13 23:03:07,668 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1005 transitions. Word has length 157 [2022-07-13 23:03:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:07,668 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1005 transitions. [2022-07-13 23:03:07,669 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-13 23:03:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1005 transitions. [2022-07-13 23:03:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-13 23:03:07,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:07,671 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-13 23:03:07,698 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-13 23:03:07,887 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-13 23:03:07,887 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1524066826, now seen corresponding path program 1 times [2022-07-13 23:03:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:07,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114596796] [2022-07-13 23:03:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 23:03:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 23:03:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 23:03:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:03:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 23:03:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 23:03:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,248 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-13 23:03:08,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:08,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114596796] [2022-07-13 23:03:08,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114596796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:08,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936773853] [2022-07-13 23:03:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:08,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:08,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:08,252 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-13 23:03:08,275 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-13 23:03:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:08,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 2964 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:08,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:08,955 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-13 23:03:08,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:08,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936773853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:08,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:08,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 23:03:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913597161] [2022-07-13 23:03:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:08,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:03:08,958 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-13 23:03:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:09,037 INFO L93 Difference]: Finished difference Result 2019 states and 2670 transitions. [2022-07-13 23:03:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:09,038 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-13 23:03:09,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:09,044 INFO L225 Difference]: With dead ends: 2019 [2022-07-13 23:03:09,044 INFO L226 Difference]: Without dead ends: 1227 [2022-07-13 23:03:09,047 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-13 23:03:09,047 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-13 23:03:09,048 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-13 23:03:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-07-13 23:03:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 832. [2022-07-13 23:03:09,095 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-13 23:03:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1072 transitions. [2022-07-13 23:03:09,098 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1072 transitions. Word has length 188 [2022-07-13 23:03:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:09,098 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1072 transitions. [2022-07-13 23:03:09,099 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-13 23:03:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1072 transitions. [2022-07-13 23:03:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-13 23:03:09,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:09,102 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-13 23:03:09,134 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-13 23:03:09,327 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-13 23:03:09,327 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash 450945966, now seen corresponding path program 1 times [2022-07-13 23:03:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:09,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134186553] [2022-07-13 23:03:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:09,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 23:03:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 23:03:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 23:03:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 23:03:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 23:03:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 23:03:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:09,703 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-13 23:03:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:09,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134186553] [2022-07-13 23:03:09,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134186553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:09,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435895465] [2022-07-13 23:03:09,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:09,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:09,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:09,706 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-13 23:03:09,707 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-13 23:03:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:10,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 2966 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:03:10,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:10,465 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-13 23:03:10,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:10,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435895465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:10,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:10,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 23:03:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905290121] [2022-07-13 23:03:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:10,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:03:10,468 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-13 23:03:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:10,540 INFO L93 Difference]: Finished difference Result 2185 states and 2888 transitions. [2022-07-13 23:03:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:10,541 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-13 23:03:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:10,546 INFO L225 Difference]: With dead ends: 2185 [2022-07-13 23:03:10,546 INFO L226 Difference]: Without dead ends: 1345 [2022-07-13 23:03:10,549 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-13 23:03:10,551 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-13 23:03:10,551 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-13 23:03:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-07-13 23:03:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 931. [2022-07-13 23:03:10,608 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-13 23:03:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1203 transitions. [2022-07-13 23:03:10,610 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1203 transitions. Word has length 191 [2022-07-13 23:03:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:10,611 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1203 transitions. [2022-07-13 23:03:10,611 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-13 23:03:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1203 transitions. [2022-07-13 23:03:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-13 23:03:10,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:10,613 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-13 23:03:10,642 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-13 23:03:10,832 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-13 23:03:10,832 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1205651782, now seen corresponding path program 1 times [2022-07-13 23:03:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:10,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827401348] [2022-07-13 23:03:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:10,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:03:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:03:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 23:03:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 23:03:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 23:03:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 23:03:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,240 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-13 23:03:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:11,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827401348] [2022-07-13 23:03:11,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827401348] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:11,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906789026] [2022-07-13 23:03:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:11,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:11,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:11,243 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-13 23:03:11,279 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-13 23:03:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 2968 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 23:03:11,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:12,032 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-13 23:03:12,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:12,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906789026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:12,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:12,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-13 23:03:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370193170] [2022-07-13 23:03:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:12,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:03:12,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:03:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:03:12,035 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-13 23:03:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:12,222 INFO L93 Difference]: Finished difference Result 1911 states and 2490 transitions. [2022-07-13 23:03:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:03:12,226 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-13 23:03:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:12,231 INFO L225 Difference]: With dead ends: 1911 [2022-07-13 23:03:12,231 INFO L226 Difference]: Without dead ends: 992 [2022-07-13 23:03:12,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-13 23:03:12,234 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-13 23:03:12,234 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-13 23:03:12,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-07-13 23:03:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 883. [2022-07-13 23:03:12,284 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-13 23:03:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1132 transitions. [2022-07-13 23:03:12,287 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1132 transitions. Word has length 194 [2022-07-13 23:03:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:12,288 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1132 transitions. [2022-07-13 23:03:12,288 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-13 23:03:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1132 transitions. [2022-07-13 23:03:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-13 23:03:12,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:12,291 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-13 23:03:12,323 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-13 23:03:12,514 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-13 23:03:12,514 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1391975651, now seen corresponding path program 1 times [2022-07-13 23:03:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:12,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702155988] [2022-07-13 23:03:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:12,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:03:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:03:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 23:03:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 23:03:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 23:03:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 23:03:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 23:03:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:12,918 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-13 23:03:12,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702155988] [2022-07-13 23:03:12,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702155988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809895325] [2022-07-13 23:03:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:12,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:12,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:12,924 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-13 23:03:12,934 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-13 23:03:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:13,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 2922 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:03:13,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:13,693 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-13 23:03:13,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:13,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809895325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:13,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:13,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-13 23:03:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153577987] [2022-07-13 23:03:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:13,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:13,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:03:13,696 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-13 23:03:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:13,764 INFO L93 Difference]: Finished difference Result 1774 states and 2281 transitions. [2022-07-13 23:03:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:13,764 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-13 23:03:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:13,772 INFO L225 Difference]: With dead ends: 1774 [2022-07-13 23:03:13,772 INFO L226 Difference]: Without dead ends: 896 [2022-07-13 23:03:13,774 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-13 23:03:13,775 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-13 23:03:13,776 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-13 23:03:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-13 23:03:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 880. [2022-07-13 23:03:13,818 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-13 23:03:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1128 transitions. [2022-07-13 23:03:13,821 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1128 transitions. Word has length 192 [2022-07-13 23:03:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:13,821 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1128 transitions. [2022-07-13 23:03:13,822 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-13 23:03:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1128 transitions. [2022-07-13 23:03:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-13 23:03:13,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:13,825 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-13 23:03:13,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:14,051 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-13 23:03:14,052 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash -978025145, now seen corresponding path program 1 times [2022-07-13 23:03:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:14,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235127086] [2022-07-13 23:03:14,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:14,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:03:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:03:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 23:03:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 23:03:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 23:03:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 23:03:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:14,444 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-13 23:03:14,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:14,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235127086] [2022-07-13 23:03:14,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235127086] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:14,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161680498] [2022-07-13 23:03:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:14,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:14,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:14,447 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-13 23:03:14,449 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-13 23:03:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:15,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 2967 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 23:03:15,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:15,465 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-13 23:03:15,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:03:15,833 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-13 23:03:15,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161680498] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:03:15,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:03:15,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 7] total 19 [2022-07-13 23:03:15,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239904656] [2022-07-13 23:03:15,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:03:15,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 23:03:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 23:03:15,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-07-13 23:03:15,843 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-13 23:03:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:19,504 INFO L93 Difference]: Finished difference Result 2336 states and 3024 transitions. [2022-07-13 23:03:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 23:03:19,505 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-13 23:03:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:19,517 INFO L225 Difference]: With dead ends: 2336 [2022-07-13 23:03:19,518 INFO L226 Difference]: Without dead ends: 1466 [2022-07-13 23:03:19,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=333, Invalid=1389, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 23:03:19,521 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 1804 mSDsluCounter, 5368 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 855 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 3961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 855 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:19,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 6021 Invalid, 3961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [855 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-13 23:03:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-07-13 23:03:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1392. [2022-07-13 23:03:19,604 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-13 23:03:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1809 transitions. [2022-07-13 23:03:19,608 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1809 transitions. Word has length 194 [2022-07-13 23:03:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:19,609 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1809 transitions. [2022-07-13 23:03:19,609 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-13 23:03:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1809 transitions. [2022-07-13 23:03:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-13 23:03:19,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:19,612 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-13 23:03:19,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:19,827 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-13 23:03:19,828 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1754849822, now seen corresponding path program 1 times [2022-07-13 23:03:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:19,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441783531] [2022-07-13 23:03:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:03:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 23:03:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:03:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:03:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:03:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 23:03:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 23:03:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 23:03:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:03:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 23:03:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 23:03:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 23:03:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 23:03:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 23:03:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,133 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-13 23:03:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:20,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441783531] [2022-07-13 23:03:20,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441783531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:20,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:20,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:03:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862715011] [2022-07-13 23:03:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:20,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:03:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:20,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:03:20,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:03:20,136 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-13 23:03:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:20,646 INFO L93 Difference]: Finished difference Result 2832 states and 3690 transitions. [2022-07-13 23:03:20,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:03:20,646 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-13 23:03:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:20,653 INFO L225 Difference]: With dead ends: 2832 [2022-07-13 23:03:20,653 INFO L226 Difference]: Without dead ends: 1446 [2022-07-13 23:03:20,657 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-13 23:03:20,657 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 94 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1017 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:20,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1017 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 23:03:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2022-07-13 23:03:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1376. [2022-07-13 23:03:20,733 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-13 23:03:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1790 transitions. [2022-07-13 23:03:20,737 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1790 transitions. Word has length 198 [2022-07-13 23:03:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:20,737 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 1790 transitions. [2022-07-13 23:03:20,738 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-13 23:03:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1790 transitions. [2022-07-13 23:03:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-13 23:03:20,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:20,741 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-13 23:03:20,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 23:03:20,741 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:20,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash 913659289, now seen corresponding path program 1 times [2022-07-13 23:03:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:20,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331871207] [2022-07-13 23:03:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:20,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:20,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 23:03:20,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [297115693] [2022-07-13 23:03:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:20,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:20,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:20,824 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-13 23:03:20,826 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-13 23:03:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:21,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 2982 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 23:03:21,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:21,659 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-13 23:03:21,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:21,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:21,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331871207] [2022-07-13 23:03:21,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 23:03:21,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297115693] [2022-07-13 23:03:21,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297115693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:21,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:21,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:03:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997630339] [2022-07-13 23:03:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:21,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:21,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:03:21,663 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-13 23:03:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:21,860 INFO L93 Difference]: Finished difference Result 1671 states and 2222 transitions. [2022-07-13 23:03:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:21,863 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-13 23:03:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:21,871 INFO L225 Difference]: With dead ends: 1671 [2022-07-13 23:03:21,871 INFO L226 Difference]: Without dead ends: 1633 [2022-07-13 23:03:21,872 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-13 23:03:21,873 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 119 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:21,873 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.1s Time] [2022-07-13 23:03:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-07-13 23:03:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1376. [2022-07-13 23:03:21,954 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-13 23:03:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1788 transitions. [2022-07-13 23:03:21,958 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1788 transitions. Word has length 201 [2022-07-13 23:03:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:21,959 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 1788 transitions. [2022-07-13 23:03:21,959 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-13 23:03:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1788 transitions. [2022-07-13 23:03:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-13 23:03:21,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:21,962 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-13 23:03:21,994 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-13 23:03:22,179 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-13 23:03:22,180 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1938080626, now seen corresponding path program 1 times [2022-07-13 23:03:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:22,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826359074] [2022-07-13 23:03:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:22,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 23:03:22,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [36947010] [2022-07-13 23:03:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:22,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:22,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:22,264 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-13 23:03:22,266 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-13 23:03:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:03:23,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:23,087 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-13 23:03:23,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:23,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826359074] [2022-07-13 23:03:23,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 23:03:23,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36947010] [2022-07-13 23:03:23,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36947010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:23,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:23,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:03:23,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291234808] [2022-07-13 23:03:23,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:23,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:03:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:23,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:03:23,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:03:23,089 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-13 23:03:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:23,109 INFO L93 Difference]: Finished difference Result 1470 states and 1895 transitions. [2022-07-13 23:03:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:03:23,110 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-13 23:03:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:23,111 INFO L225 Difference]: With dead ends: 1470 [2022-07-13 23:03:23,111 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 23:03:23,113 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-13 23:03:23,114 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-13 23:03:23,114 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-13 23:03:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 23:03:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 23:03:23,115 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-13 23:03:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 23:03:23,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-07-13 23:03:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:23,116 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 23:03:23,116 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-13 23:03:23,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 23:03:23,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 23:03:23,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 23:03:23,154 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-13 23:03:23,347 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-13 23:03:23,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 23:03:27,492 INFO L899 garLoopResultBuilder]: For program point usb_fill_int_urbFINAL(lines 3484 3507) no Hoare annotation was computed. [2022-07-13 23:03:27,492 INFO L899 garLoopResultBuilder]: For program point L3499(lines 3499 3503) no Hoare annotation was computed. [2022-07-13 23:03:27,493 INFO L899 garLoopResultBuilder]: For program point L3496(lines 3496 3503) no Hoare annotation was computed. [2022-07-13 23:03:27,493 INFO L899 garLoopResultBuilder]: For program point L3499-2(lines 3496 3503) no Hoare annotation was computed. [2022-07-13 23:03:27,493 INFO L899 garLoopResultBuilder]: For program point usb_fill_int_urbEXIT(lines 3484 3507) no Hoare annotation was computed. [2022-07-13 23:03:27,493 INFO L902 garLoopResultBuilder]: At program point usb_fill_int_urbENTRY(lines 3484 3507) the Hoare annotation is: true [2022-07-13 23:03:27,493 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 5686 5688) no Hoare annotation was computed. [2022-07-13 23:03:27,493 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-13 23:03:27,494 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 5686 5688) no Hoare annotation was computed. [2022-07-13 23:03:27,494 INFO L899 garLoopResultBuilder]: For program point usb_get_intfdataEXIT(lines 3440 3448) no Hoare annotation was computed. [2022-07-13 23:03:27,494 INFO L902 garLoopResultBuilder]: At program point usb_get_intfdataENTRY(lines 3440 3448) the Hoare annotation is: true [2022-07-13 23:03:27,494 INFO L899 garLoopResultBuilder]: For program point usb_get_intfdataFINAL(lines 3440 3448) no Hoare annotation was computed. [2022-07-13 23:03:27,494 INFO L899 garLoopResultBuilder]: For program point L5604-1(line 5604) no Hoare annotation was computed. [2022-07-13 23:03:27,494 INFO L902 garLoopResultBuilder]: At program point L5604-2(lines 5603 5605) the Hoare annotation is: true [2022-07-13 23:03:27,494 INFO L902 garLoopResultBuilder]: At program point L5604(line 5604) the Hoare annotation is: true [2022-07-13 23:03:27,494 INFO L899 garLoopResultBuilder]: For program point usb_submit_urbFINAL(lines 5675 5677) no Hoare annotation was computed. [2022-07-13 23:03:27,495 INFO L899 garLoopResultBuilder]: For program point usb_submit_urbEXIT(lines 5675 5677) no Hoare annotation was computed. [2022-07-13 23:03:27,495 INFO L902 garLoopResultBuilder]: At program point usb_submit_urbENTRY(lines 5675 5677) the Hoare annotation is: true [2022-07-13 23:03:27,495 INFO L899 garLoopResultBuilder]: For program point L5664-1(line 5664) no Hoare annotation was computed. [2022-07-13 23:03:27,495 INFO L899 garLoopResultBuilder]: For program point usb_match_idFINAL(lines 5663 5665) no Hoare annotation was computed. [2022-07-13 23:03:27,495 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-13 23:03:27,495 INFO L899 garLoopResultBuilder]: For program point usb_match_idEXIT(lines 5663 5665) no Hoare annotation was computed. [2022-07-13 23:03:27,495 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-13 23:03:27,495 INFO L902 garLoopResultBuilder]: At program point mutex_unlockENTRY(lines 5641 5643) the Hoare annotation is: true [2022-07-13 23:03:27,495 INFO L899 garLoopResultBuilder]: For program point mutex_unlockEXIT(lines 5641 5643) no Hoare annotation was computed. [2022-07-13 23:03:27,495 INFO L899 garLoopResultBuilder]: For program point mutex_unlockFINAL(lines 5641 5643) no Hoare annotation was computed. [2022-07-13 23:03:27,495 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-13 23:03:27,495 INFO L899 garLoopResultBuilder]: For program point L3420-1(line 3420) no Hoare annotation was computed. [2022-07-13 23:03:27,495 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3416 3424) no Hoare annotation was computed. [2022-07-13 23:03:27,495 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-13 23:03:27,495 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3416 3424) no Hoare annotation was computed. [2022-07-13 23:03:27,496 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 5405 5411) the Hoare annotation is: true [2022-07-13 23:03:27,496 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 5405 5411) no Hoare annotation was computed. [2022-07-13 23:03:27,496 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-13 23:03:27,496 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-13 23:03:27,496 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 3405 3414) no Hoare annotation was computed. [2022-07-13 23:03:27,496 INFO L899 garLoopResultBuilder]: For program point L5575-1(line 5575) no Hoare annotation was computed. [2022-07-13 23:03:27,496 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 3405 3414) no Hoare annotation was computed. [2022-07-13 23:03:27,496 INFO L902 garLoopResultBuilder]: At program point L5575-2(lines 5574 5576) the Hoare annotation is: true [2022-07-13 23:03:27,496 INFO L902 garLoopResultBuilder]: At program point L5633(lines 5632 5634) the Hoare annotation is: true [2022-07-13 23:03:27,496 INFO L899 garLoopResultBuilder]: For program point deregister_from_lircEXIT(lines 3903 3923) no Hoare annotation was computed. [2022-07-13 23:03:27,496 INFO L899 garLoopResultBuilder]: For program point L3911(lines 3911 3920) no Hoare annotation was computed. [2022-07-13 23:03:27,497 INFO L902 garLoopResultBuilder]: At program point deregister_from_lircENTRY(lines 3903 3923) the Hoare annotation is: true [2022-07-13 23:03:27,497 INFO L899 garLoopResultBuilder]: For program point L3911-2(lines 3903 3923) no Hoare annotation was computed. [2022-07-13 23:03:27,497 INFO L899 garLoopResultBuilder]: For program point mutex_lock_nestedFINAL(lines 5638 5640) no Hoare annotation was computed. [2022-07-13 23:03:27,497 INFO L902 garLoopResultBuilder]: At program point mutex_lock_nestedENTRY(lines 5638 5640) the Hoare annotation is: true [2022-07-13 23:03:27,497 INFO L899 garLoopResultBuilder]: For program point mutex_lock_nestedEXIT(lines 5638 5640) no Hoare annotation was computed. [2022-07-13 23:03:27,497 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3451 3459) the Hoare annotation is: true [2022-07-13 23:03:27,497 INFO L902 garLoopResultBuilder]: At program point L5612(lines 5611 5613) the Hoare annotation is: true [2022-07-13 23:03:27,497 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3451 3459) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3451 3459) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L902 garLoopResultBuilder]: At program point __init_waitqueue_headENTRY(lines 5549 5551) the Hoare annotation is: true [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point __init_waitqueue_headFINAL(lines 5549 5551) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point __init_waitqueue_headEXIT(lines 5549 5551) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 5624 5626) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point L5625(line 5625) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L902 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 5624 5626) the Hoare annotation is: true [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 5624 5626) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point imon_initEXIT(lines 5234 5250) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L902 garLoopResultBuilder]: At program point L3478(lines 3472 3480) the Hoare annotation is: true [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point L5241(lines 5241 5247) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L902 garLoopResultBuilder]: At program point L5672(lines 5671 5673) the Hoare annotation is: true [2022-07-13 23:03:27,498 INFO L902 garLoopResultBuilder]: At program point imon_initENTRY(lines 5234 5250) the Hoare annotation is: true [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point imon_initFINAL(lines 5234 5250) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L902 garLoopResultBuilder]: At program point L5504loopEntry(lines 5504 5523) the Hoare annotation is: true [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point L5513(lines 5513 5518) no Hoare annotation was computed. [2022-07-13 23:03:27,498 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 5500 5529) no Hoare annotation was computed. [2022-07-13 23:03:27,499 INFO L902 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 5500 5529) the Hoare annotation is: true [2022-07-13 23:03:27,499 INFO L899 garLoopResultBuilder]: For program point L5505(lines 5504 5523) no Hoare annotation was computed. [2022-07-13 23:03:27,499 INFO L902 garLoopResultBuilder]: At program point L5524(lines 5500 5529) the Hoare annotation is: true [2022-07-13 23:03:27,499 INFO L899 garLoopResultBuilder]: For program point L5516-1(lines 5513 5518) no Hoare annotation was computed. [2022-07-13 23:03:27,499 INFO L902 garLoopResultBuilder]: At program point L5516(line 5516) the Hoare annotation is: true [2022-07-13 23:03:27,499 INFO L899 garLoopResultBuilder]: For program point L5506(lines 5504 5523) no Hoare annotation was computed. [2022-07-13 23:03:27,499 INFO L902 garLoopResultBuilder]: At program point L5508(line 5508) the Hoare annotation is: true [2022-07-13 23:03:27,499 INFO L902 garLoopResultBuilder]: At program point __create_pipeENTRY(lines 3515 3520) the Hoare annotation is: true [2022-07-13 23:03:27,499 INFO L899 garLoopResultBuilder]: For program point __create_pipeFINAL(lines 3515 3520) no Hoare annotation was computed. [2022-07-13 23:03:27,500 INFO L899 garLoopResultBuilder]: For program point __create_pipeEXIT(lines 3515 3520) no Hoare annotation was computed. [2022-07-13 23:03:27,500 INFO L899 garLoopResultBuilder]: For program point L3871-1(line 3871) no Hoare annotation was computed. [2022-07-13 23:03:27,500 INFO L902 garLoopResultBuilder]: At program point L3871(line 3871) the Hoare annotation is: true [2022-07-13 23:03:27,500 INFO L899 garLoopResultBuilder]: For program point L3869-1(line 3869) no Hoare annotation was computed. [2022-07-13 23:03:27,500 INFO L902 garLoopResultBuilder]: At program point L3869(line 3869) the Hoare annotation is: true [2022-07-13 23:03:27,500 INFO L899 garLoopResultBuilder]: For program point L3867-1(line 3867) no Hoare annotation was computed. [2022-07-13 23:03:27,500 INFO L902 garLoopResultBuilder]: At program point L3867(line 3867) the Hoare annotation is: true [2022-07-13 23:03:27,500 INFO L899 garLoopResultBuilder]: For program point free_imon_contextEXIT(lines 3861 3902) no Hoare annotation was computed. [2022-07-13 23:03:27,500 INFO L899 garLoopResultBuilder]: For program point L3876(lines 3875 3896) no Hoare annotation was computed. [2022-07-13 23:03:27,500 INFO L902 garLoopResultBuilder]: At program point L3872(line 3872) the Hoare annotation is: true [2022-07-13 23:03:27,500 INFO L902 garLoopResultBuilder]: At program point free_imon_contextENTRY(lines 3861 3902) the Hoare annotation is: true [2022-07-13 23:03:27,500 INFO L902 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: true [2022-07-13 23:03:27,500 INFO L902 garLoopResultBuilder]: At program point L3872-1(lines 3872 3896) the Hoare annotation is: true [2022-07-13 23:03:27,500 INFO L902 garLoopResultBuilder]: At program point L3868(line 3868) the Hoare annotation is: true [2022-07-13 23:03:27,500 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-07-13 23:03:27,500 INFO L899 garLoopResultBuilder]: For program point L3868-1(line 3868) no Hoare annotation was computed. [2022-07-13 23:03:27,500 INFO L902 garLoopResultBuilder]: At program point L3897(lines 3861 3902) the Hoare annotation is: true [2022-07-13 23:03:27,500 INFO L899 garLoopResultBuilder]: For program point L3883(lines 3883 3889) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point L3879(line 3879) no Hoare annotation was computed. [2022-07-13 23:03:27,501 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-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5569 5573) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point L5571(line 5571) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5569 5573) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L902 garLoopResultBuilder]: At program point usb_alloc_urbENTRY(lines 5474 5498) the Hoare annotation is: true [2022-07-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point usb_alloc_urbFINAL(lines 5474 5498) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point L5493(lines 5478 5494) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point L5482(line 5482) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point L5485(lines 5485 5488) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L902 garLoopResultBuilder]: At program point L5479loopEntry(lines 5479 5492) the Hoare annotation is: true [2022-07-13 23:03:27,501 INFO L902 garLoopResultBuilder]: At program point L5480(line 5480) the Hoare annotation is: true [2022-07-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point usb_alloc_urbEXIT(lines 5474 5498) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L899 garLoopResultBuilder]: For program point L5023(lines 5022 5043) no Hoare annotation was computed. [2022-07-13 23:03:27,501 INFO L895 garLoopResultBuilder]: At program point L4858(line 4858) the Hoare annotation is: false [2022-07-13 23:03:27,501 INFO L895 garLoopResultBuilder]: At program point L4957(lines 4949 4958) the Hoare annotation is: false [2022-07-13 23:03:27,502 INFO L899 garLoopResultBuilder]: For program point L4858-1(line 4858) no Hoare annotation was computed. [2022-07-13 23:03:27,502 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-13 23:03:27,502 INFO L895 garLoopResultBuilder]: At program point L5222(line 5222) the Hoare annotation is: false [2022-07-13 23:03:27,502 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-13 23:03:27,502 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-13 23:03:27,502 INFO L899 garLoopResultBuilder]: For program point L5156-2(lines 5156 5162) no Hoare annotation was computed. [2022-07-13 23:03:27,502 INFO L899 garLoopResultBuilder]: For program point L5222-1(line 5222) no Hoare annotation was computed. [2022-07-13 23:03:27,502 INFO L899 garLoopResultBuilder]: For program point L5156(lines 5156 5162) no Hoare annotation was computed. [2022-07-13 23:03:27,502 INFO L899 garLoopResultBuilder]: For program point L4694(line 4694) no Hoare annotation was computed. [2022-07-13 23:03:27,502 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-13 23:03:27,502 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-13 23:03:27,502 INFO L899 garLoopResultBuilder]: For program point L4661-1(line 4661) no Hoare annotation was computed. [2022-07-13 23:03:27,503 INFO L895 garLoopResultBuilder]: At program point L5652(lines 5651 5653) the Hoare annotation is: false [2022-07-13 23:03:27,503 INFO L899 garLoopResultBuilder]: For program point L5091(lines 5091 5133) no Hoare annotation was computed. [2022-07-13 23:03:27,503 INFO L899 garLoopResultBuilder]: For program point L4860-2(lines 4856 4890) no Hoare annotation was computed. [2022-07-13 23:03:27,503 INFO L899 garLoopResultBuilder]: For program point L4893(line 4893) no Hoare annotation was computed. [2022-07-13 23:03:27,503 INFO L899 garLoopResultBuilder]: For program point L4860(lines 4860 4863) no Hoare annotation was computed. [2022-07-13 23:03:27,503 INFO L895 garLoopResultBuilder]: At program point L5554(lines 5553 5555) the Hoare annotation is: false [2022-07-13 23:03:27,503 INFO L899 garLoopResultBuilder]: For program point L5323(lines 5323 5380) no Hoare annotation was computed. [2022-07-13 23:03:27,503 INFO L899 garLoopResultBuilder]: For program point L5224-1(line 5224) no Hoare annotation was computed. [2022-07-13 23:03:27,504 INFO L895 garLoopResultBuilder]: At program point L5158(line 5158) the Hoare annotation is: false [2022-07-13 23:03:27,504 INFO L895 garLoopResultBuilder]: At program point L5224(line 5224) the Hoare annotation is: false [2022-07-13 23:03:27,504 INFO L899 garLoopResultBuilder]: For program point L5026(line 5026) no Hoare annotation was computed. [2022-07-13 23:03:27,504 INFO L899 garLoopResultBuilder]: For program point L5158-1(line 5158) no Hoare annotation was computed. [2022-07-13 23:03:27,504 INFO L895 garLoopResultBuilder]: At program point L5092(lines 5091 5133) the Hoare annotation is: false [2022-07-13 23:03:27,504 INFO L899 garLoopResultBuilder]: For program point L4828(lines 4828 4834) no Hoare annotation was computed. [2022-07-13 23:03:27,504 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-13 23:03:27,505 INFO L895 garLoopResultBuilder]: At program point L5192-1(lines 5173 5194) the Hoare annotation is: false [2022-07-13 23:03:27,505 INFO L895 garLoopResultBuilder]: At program point L5225(lines 5225 5227) the Hoare annotation is: false [2022-07-13 23:03:27,505 INFO L899 garLoopResultBuilder]: For program point L5225-1(lines 5225 5227) no Hoare annotation was computed. [2022-07-13 23:03:27,505 INFO L895 garLoopResultBuilder]: At program point L5192(line 5192) the Hoare annotation is: false [2022-07-13 23:03:27,505 INFO L899 garLoopResultBuilder]: For program point L4928-1(line 4928) no Hoare annotation was computed. [2022-07-13 23:03:27,505 INFO L895 garLoopResultBuilder]: At program point L4928(line 4928) the Hoare annotation is: false [2022-07-13 23:03:27,505 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-13 23:03:27,505 INFO L899 garLoopResultBuilder]: For program point L4664(lines 4664 4671) no Hoare annotation was computed. [2022-07-13 23:03:27,506 INFO L899 garLoopResultBuilder]: For program point L5094(lines 5094 5133) no Hoare annotation was computed. [2022-07-13 23:03:27,506 INFO L899 garLoopResultBuilder]: For program point L4896(lines 4896 4903) no Hoare annotation was computed. [2022-07-13 23:03:27,506 INFO L899 garLoopResultBuilder]: For program point L4698(lines 4698 4704) no Hoare annotation was computed. [2022-07-13 23:03:27,506 INFO L895 garLoopResultBuilder]: At program point L3575(lines 3555 3576) the Hoare annotation is: false [2022-07-13 23:03:27,506 INFO L899 garLoopResultBuilder]: For program point L5326(lines 5326 5380) no Hoare annotation was computed. [2022-07-13 23:03:27,506 INFO L895 garLoopResultBuilder]: At program point L5095(lines 5070 5133) the Hoare annotation is: false [2022-07-13 23:03:27,506 INFO L899 garLoopResultBuilder]: For program point L4930(lines 4930 4937) no Hoare annotation was computed. [2022-07-13 23:03:27,507 INFO L899 garLoopResultBuilder]: For program point L4996-2(lines 4996 4999) no Hoare annotation was computed. [2022-07-13 23:03:27,507 INFO L899 garLoopResultBuilder]: For program point L4996(lines 4996 4999) no Hoare annotation was computed. [2022-07-13 23:03:27,507 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-13 23:03:27,507 INFO L895 garLoopResultBuilder]: At program point L5393(lines 5286 5395) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-13 23:03:27,507 INFO L899 garLoopResultBuilder]: For program point L5228-1(line 5228) no Hoare annotation was computed. [2022-07-13 23:03:27,507 INFO L895 garLoopResultBuilder]: At program point L5228(line 5228) the Hoare annotation is: false [2022-07-13 23:03:27,507 INFO L899 garLoopResultBuilder]: For program point L5030(lines 5030 5036) no Hoare annotation was computed. [2022-07-13 23:03:27,508 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-13 23:03:27,508 INFO L899 garLoopResultBuilder]: For program point L5658-1(line 5658) no Hoare annotation was computed. [2022-07-13 23:03:27,508 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-13 23:03:27,508 INFO L899 garLoopResultBuilder]: For program point L5196(line 5196) no Hoare annotation was computed. [2022-07-13 23:03:27,508 INFO L895 garLoopResultBuilder]: At program point L5097(lines 5073 5133) the Hoare annotation is: false [2022-07-13 23:03:27,508 INFO L899 garLoopResultBuilder]: For program point L4866(lines 4865 4886) no Hoare annotation was computed. [2022-07-13 23:03:27,508 INFO L899 garLoopResultBuilder]: For program point L4734(line 4734) no Hoare annotation was computed. [2022-07-13 23:03:27,508 INFO L899 garLoopResultBuilder]: For program point L4734-4(line 4734) no Hoare annotation was computed. [2022-07-13 23:03:27,509 INFO L899 garLoopResultBuilder]: For program point L4734-2(line 4734) no Hoare annotation was computed. [2022-07-13 23:03:27,509 INFO L899 garLoopResultBuilder]: For program point L4734-8(line 4734) no Hoare annotation was computed. [2022-07-13 23:03:27,509 INFO L895 garLoopResultBuilder]: At program point L3545loopEntry(lines 3545 3551) the Hoare annotation is: false [2022-07-13 23:03:27,509 INFO L899 garLoopResultBuilder]: For program point L4734-6(line 4734) no Hoare annotation was computed. [2022-07-13 23:03:27,509 INFO L895 garLoopResultBuilder]: At program point L5230(lines 5214 5232) the Hoare annotation is: false [2022-07-13 23:03:27,509 INFO L899 garLoopResultBuilder]: For program point L5329(lines 5329 5380) no Hoare annotation was computed. [2022-07-13 23:03:27,509 INFO L895 garLoopResultBuilder]: At program point L5065(lines 4643 5139) the Hoare annotation is: false [2022-07-13 23:03:27,510 INFO L899 garLoopResultBuilder]: For program point L4735(line 4735) no Hoare annotation was computed. [2022-07-13 23:03:27,510 INFO L899 garLoopResultBuilder]: For program point L4735-4(line 4735) no Hoare annotation was computed. [2022-07-13 23:03:27,510 INFO L899 garLoopResultBuilder]: For program point L4735-2(line 4735) no Hoare annotation was computed. [2022-07-13 23:03:27,510 INFO L895 garLoopResultBuilder]: At program point L3546(line 3546) the Hoare annotation is: false [2022-07-13 23:03:27,510 INFO L899 garLoopResultBuilder]: For program point L4735-8(line 4735) no Hoare annotation was computed. [2022-07-13 23:03:27,510 INFO L899 garLoopResultBuilder]: For program point L4735-6(line 4735) no Hoare annotation was computed. [2022-07-13 23:03:27,510 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-13 23:03:27,510 INFO L895 garLoopResultBuilder]: At program point L5165(line 5165) the Hoare annotation is: false [2022-07-13 23:03:27,511 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-13 23:03:27,511 INFO L899 garLoopResultBuilder]: For program point L5165-1(line 5165) no Hoare annotation was computed. [2022-07-13 23:03:27,511 INFO L899 garLoopResultBuilder]: For program point L4736(lines 4736 4811) no Hoare annotation was computed. [2022-07-13 23:03:27,511 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-13 23:03:27,511 INFO L895 garLoopResultBuilder]: At program point L5199(lines 5141 5201) the Hoare annotation is: false [2022-07-13 23:03:27,511 INFO L899 garLoopResultBuilder]: For program point L5298-1(line 5298) no Hoare annotation was computed. [2022-07-13 23:03:27,511 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-13 23:03:27,511 INFO L895 garLoopResultBuilder]: At program point L5001(line 5001) the Hoare annotation is: false [2022-07-13 23:03:27,511 INFO L899 garLoopResultBuilder]: For program point L5001-1(line 5001) no Hoare annotation was computed. [2022-07-13 23:03:27,511 INFO L899 garLoopResultBuilder]: For program point L4869(line 4869) no Hoare annotation was computed. [2022-07-13 23:03:27,511 INFO L899 garLoopResultBuilder]: For program point L4737(lines 4737 4772) no Hoare annotation was computed. [2022-07-13 23:03:27,511 INFO L895 garLoopResultBuilder]: At program point L5629(lines 5628 5630) the Hoare annotation is: false [2022-07-13 23:03:27,511 INFO L899 garLoopResultBuilder]: For program point L5167(lines 5167 5172) no Hoare annotation was computed. [2022-07-13 23:03:27,511 INFO L895 garLoopResultBuilder]: At program point L5002(lines 5002 5004) the Hoare annotation is: false [2022-07-13 23:03:27,511 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-13 23:03:27,511 INFO L899 garLoopResultBuilder]: For program point L5167-2(lines 5167 5172) no Hoare annotation was computed. [2022-07-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L5002-1(lines 5002 5004) no Hoare annotation was computed. [2022-07-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L4738(lines 4738 4769) no Hoare annotation was computed. [2022-07-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L3582(lines 3582 3590) no Hoare annotation was computed. [2022-07-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L3582-2(lines 3582 3590) no Hoare annotation was computed. [2022-07-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L5300(lines 5300 5303) no Hoare annotation was computed. [2022-07-13 23:03:27,512 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-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L4673-1(line 4673) no Hoare annotation was computed. [2022-07-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L5136(line 5136) no Hoare annotation was computed. [2022-07-13 23:03:27,512 INFO L895 garLoopResultBuilder]: At program point L4905(line 4905) the Hoare annotation is: false [2022-07-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L4905-1(line 4905) no Hoare annotation was computed. [2022-07-13 23:03:27,512 INFO L895 garLoopResultBuilder]: At program point L4939(line 4939) the Hoare annotation is: false [2022-07-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L4939-1(line 4939) no Hoare annotation was computed. [2022-07-13 23:03:27,512 INFO L895 garLoopResultBuilder]: At program point L5005(line 5005) the Hoare annotation is: false [2022-07-13 23:03:27,512 INFO L899 garLoopResultBuilder]: For program point L5005-1(line 5005) no Hoare annotation was computed. [2022-07-13 23:03:27,513 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-13 23:03:27,513 INFO L899 garLoopResultBuilder]: For program point L4873(lines 4873 4879) no Hoare annotation was computed. [2022-07-13 23:03:27,513 INFO L899 garLoopResultBuilder]: For program point L4675(lines 4675 4679) no Hoare annotation was computed. [2022-07-13 23:03:27,513 INFO L895 garLoopResultBuilder]: At program point L3552(lines 3543 3600) the Hoare annotation is: false [2022-07-13 23:03:27,513 INFO L899 garLoopResultBuilder]: For program point L5534(lines 5534 5539) no Hoare annotation was computed. [2022-07-13 23:03:27,513 INFO L899 garLoopResultBuilder]: For program point L4675-2(lines 4675 4679) no Hoare annotation was computed. [2022-07-13 23:03:27,513 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-13 23:03:27,514 INFO L895 garLoopResultBuilder]: At program point L4973(line 4973) the Hoare annotation is: false [2022-07-13 23:03:27,514 INFO L899 garLoopResultBuilder]: For program point L4973-1(line 4973) no Hoare annotation was computed. [2022-07-13 23:03:27,514 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-13 23:03:27,514 INFO L895 garLoopResultBuilder]: At program point L4742loopEntry(lines 4742 4763) the Hoare annotation is: false [2022-07-13 23:03:27,514 INFO L895 garLoopResultBuilder]: At program point L5601(lines 5600 5602) the Hoare annotation is: false [2022-07-13 23:03:27,514 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-13 23:03:27,514 INFO L899 garLoopResultBuilder]: For program point L5007(lines 5007 5015) no Hoare annotation was computed. [2022-07-13 23:03:27,515 INFO L899 garLoopResultBuilder]: For program point L5073(lines 5073 5133) no Hoare annotation was computed. [2022-07-13 23:03:27,515 INFO L899 garLoopResultBuilder]: For program point L4941(lines 4941 4948) no Hoare annotation was computed. [2022-07-13 23:03:27,515 INFO L899 garLoopResultBuilder]: For program point L4908(lines 4908 4915) no Hoare annotation was computed. [2022-07-13 23:03:27,515 INFO L899 garLoopResultBuilder]: For program point L4743(lines 4742 4763) no Hoare annotation was computed. [2022-07-13 23:03:27,515 INFO L899 garLoopResultBuilder]: For program point L4776(lines 4776 4809) no Hoare annotation was computed. [2022-07-13 23:03:27,515 INFO L895 garLoopResultBuilder]: At program point L5668(lines 5667 5669) the Hoare annotation is: false [2022-07-13 23:03:27,515 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 23:03:27,515 INFO L899 garLoopResultBuilder]: For program point L5173(lines 5173 5194) no Hoare annotation was computed. [2022-07-13 23:03:27,516 INFO L899 garLoopResultBuilder]: For program point L4777(lines 4777 4807) no Hoare annotation was computed. [2022-07-13 23:03:27,516 INFO L895 garLoopResultBuilder]: At program point L5537(line 5537) the Hoare annotation is: false [2022-07-13 23:03:27,516 INFO L899 garLoopResultBuilder]: For program point L5537-1(lines 5533 5547) no Hoare annotation was computed. [2022-07-13 23:03:27,516 INFO L895 garLoopResultBuilder]: At program point L5207(line 5207) the Hoare annotation is: false [2022-07-13 23:03:27,516 INFO L899 garLoopResultBuilder]: For program point L5207-1(line 5207) no Hoare annotation was computed. [2022-07-13 23:03:27,516 INFO L899 garLoopResultBuilder]: For program point L5174(lines 5174 5189) no Hoare annotation was computed. [2022-07-13 23:03:27,516 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-13 23:03:27,517 INFO L899 garLoopResultBuilder]: For program point L5307(line 5307) no Hoare annotation was computed. [2022-07-13 23:03:27,517 INFO L899 garLoopResultBuilder]: For program point L5340(lines 5340 5343) no Hoare annotation was computed. [2022-07-13 23:03:27,517 INFO L899 garLoopResultBuilder]: For program point L5076(lines 5076 5133) no Hoare annotation was computed. [2022-07-13 23:03:27,517 INFO L899 garLoopResultBuilder]: For program point L4977(lines 4977 4988) no Hoare annotation was computed. [2022-07-13 23:03:27,517 INFO L899 garLoopResultBuilder]: For program point L4746(line 4746) no Hoare annotation was computed. [2022-07-13 23:03:27,517 INFO L895 garLoopResultBuilder]: At program point L3524(lines 3521 3526) the Hoare annotation is: false [2022-07-13 23:03:27,517 INFO L895 garLoopResultBuilder]: At program point L3557(line 3557) the Hoare annotation is: false [2022-07-13 23:03:27,517 INFO L895 garLoopResultBuilder]: At program point L5176-1(line 5176) the Hoare annotation is: false [2022-07-13 23:03:27,518 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-13 23:03:27,518 INFO L895 garLoopResultBuilder]: At program point L5209(line 5209) the Hoare annotation is: false [2022-07-13 23:03:27,518 INFO L899 garLoopResultBuilder]: For program point L5209-1(line 5209) no Hoare annotation was computed. [2022-07-13 23:03:27,518 INFO L895 garLoopResultBuilder]: At program point L5176(line 5176) the Hoare annotation is: false [2022-07-13 23:03:27,518 INFO L895 garLoopResultBuilder]: At program point L5011(line 5011) the Hoare annotation is: false [2022-07-13 23:03:27,518 INFO L895 garLoopResultBuilder]: At program point L5044(lines 5021 5045) the Hoare annotation is: false [2022-07-13 23:03:27,518 INFO L899 garLoopResultBuilder]: For program point L5177(line 5177) no Hoare annotation was computed. [2022-07-13 23:03:27,519 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-13 23:03:27,519 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-13 23:03:27,519 INFO L899 garLoopResultBuilder]: For program point L3559(line 3559) no Hoare annotation was computed. [2022-07-13 23:03:27,519 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 23:03:27,519 INFO L895 garLoopResultBuilder]: At program point L5211(lines 5202 5213) the Hoare annotation is: false [2022-07-13 23:03:27,519 INFO L899 garLoopResultBuilder]: For program point L5079(lines 5079 5133) no Hoare annotation was computed. [2022-07-13 23:03:27,519 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-13 23:03:27,519 INFO L899 garLoopResultBuilder]: For program point L4782(lines 4781 4802) no Hoare annotation was computed. [2022-07-13 23:03:27,520 INFO L899 garLoopResultBuilder]: For program point L4716(line 4716) no Hoare annotation was computed. [2022-07-13 23:03:27,520 INFO L899 garLoopResultBuilder]: For program point L5311(lines 5311 5316) no Hoare annotation was computed. [2022-07-13 23:03:27,520 INFO L899 garLoopResultBuilder]: For program point L5179(lines 5179 5184) no Hoare annotation was computed. [2022-07-13 23:03:27,520 INFO L899 garLoopResultBuilder]: For program point L4750(lines 4750 4756) no Hoare annotation was computed. [2022-07-13 23:03:27,520 INFO L895 garLoopResultBuilder]: At program point L5543(line 5543) the Hoare annotation is: false [2022-07-13 23:03:27,520 INFO L895 garLoopResultBuilder]: At program point L5543-1(lines 5531 5548) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-13 23:03:27,520 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-13 23:03:27,521 INFO L899 garLoopResultBuilder]: For program point L4817(lines 4817 4846) no Hoare annotation was computed. [2022-07-13 23:03:27,521 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-13 23:03:27,521 INFO L895 garLoopResultBuilder]: At program point L3562loopEntry(lines 3562 3569) the Hoare annotation is: false [2022-07-13 23:03:27,521 INFO L899 garLoopResultBuilder]: For program point L3595(lines 3595 3598) no Hoare annotation was computed. [2022-07-13 23:03:27,521 INFO L899 garLoopResultBuilder]: For program point L3595-2(lines 3595 3598) no Hoare annotation was computed. [2022-07-13 23:03:27,521 INFO L899 garLoopResultBuilder]: For program point L5313(lines 5313 5316) no Hoare annotation was computed. [2022-07-13 23:03:27,521 INFO L899 garLoopResultBuilder]: For program point L5313-1(lines 5311 5316) no Hoare annotation was computed. [2022-07-13 23:03:27,521 INFO L895 garLoopResultBuilder]: At program point L5148-1(line 5148) the Hoare annotation is: false [2022-07-13 23:03:27,522 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 23:03:27,522 INFO L899 garLoopResultBuilder]: For program point L5082(lines 5082 5133) no Hoare annotation was computed. [2022-07-13 23:03:27,522 INFO L895 garLoopResultBuilder]: At program point L5181(line 5181) the Hoare annotation is: false [2022-07-13 23:03:27,522 INFO L895 garLoopResultBuilder]: At program point L5148(line 5148) the Hoare annotation is: false [2022-07-13 23:03:27,522 INFO L895 garLoopResultBuilder]: At program point L4950loopEntry(lines 4950 4956) the Hoare annotation is: false [2022-07-13 23:03:27,522 INFO L899 garLoopResultBuilder]: For program point L4785(line 4785) no Hoare annotation was computed. [2022-07-13 23:03:27,522 INFO L895 garLoopResultBuilder]: At program point L5578(lines 5577 5579) the Hoare annotation is: false [2022-07-13 23:03:27,523 INFO L899 garLoopResultBuilder]: For program point L3563(line 3563) no Hoare annotation was computed. [2022-07-13 23:03:27,523 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-13 23:03:27,523 INFO L899 garLoopResultBuilder]: For program point L5050(lines 5050 5056) no Hoare annotation was computed. [2022-07-13 23:03:27,523 INFO L899 garLoopResultBuilder]: For program point L5149(line 5149) no Hoare annotation was computed. [2022-07-13 23:03:27,523 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-13 23:03:27,523 INFO L899 garLoopResultBuilder]: For program point L4951(line 4951) no Hoare annotation was computed. [2022-07-13 23:03:27,523 INFO L895 garLoopResultBuilder]: At program point L5017(line 5017) the Hoare annotation is: false [2022-07-13 23:03:27,523 INFO L899 garLoopResultBuilder]: For program point L5017-1(line 5017) no Hoare annotation was computed. [2022-07-13 23:03:27,524 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-13 23:03:27,524 INFO L899 garLoopResultBuilder]: For program point L4919(lines 4919 4926) no Hoare annotation was computed. [2022-07-13 23:03:27,524 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-13 23:03:27,524 INFO L899 garLoopResultBuilder]: For program point L4721(lines 4720 4813) no Hoare annotation was computed. [2022-07-13 23:03:27,524 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-13 23:03:27,524 INFO L899 garLoopResultBuilder]: For program point L5019(lines 5019 5060) no Hoare annotation was computed. [2022-07-13 23:03:27,524 INFO L899 garLoopResultBuilder]: For program point L5019-1(lines 5019 5060) no Hoare annotation was computed. [2022-07-13 23:03:27,525 INFO L899 garLoopResultBuilder]: For program point L5085(lines 5085 5133) no Hoare annotation was computed. [2022-07-13 23:03:27,525 INFO L899 garLoopResultBuilder]: For program point L4821(lines 4820 4841) no Hoare annotation was computed. [2022-07-13 23:03:27,525 INFO L895 garLoopResultBuilder]: At program point L3599(lines 3535 3601) the Hoare annotation is: false [2022-07-13 23:03:27,525 INFO L895 garLoopResultBuilder]: At program point L5581(lines 5580 5582) the Hoare annotation is: false [2022-07-13 23:03:27,525 INFO L895 garLoopResultBuilder]: At program point L5152-1(line 5152) the Hoare annotation is: false [2022-07-13 23:03:27,525 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 23:03:27,525 INFO L895 garLoopResultBuilder]: At program point L5152(line 5152) the Hoare annotation is: false [2022-07-13 23:03:27,525 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-13 23:03:27,526 INFO L895 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: false [2022-07-13 23:03:27,526 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-07-13 23:03:27,526 INFO L899 garLoopResultBuilder]: For program point L5020(lines 5020 5058) no Hoare annotation was computed. [2022-07-13 23:03:27,526 INFO L899 garLoopResultBuilder]: For program point L4723(lines 4723 4729) no Hoare annotation was computed. [2022-07-13 23:03:27,526 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-13 23:03:27,526 INFO L899 garLoopResultBuilder]: For program point L4789(lines 4789 4795) no Hoare annotation was computed. [2022-07-13 23:03:27,526 INFO L899 garLoopResultBuilder]: For program point L4723-2(lines 4722 4732) no Hoare annotation was computed. [2022-07-13 23:03:27,527 INFO L895 garLoopResultBuilder]: At program point L3336(lines 3333 3338) the Hoare annotation is: false [2022-07-13 23:03:27,527 INFO L899 garLoopResultBuilder]: For program point L5153(line 5153) no Hoare annotation was computed. [2022-07-13 23:03:27,527 INFO L899 garLoopResultBuilder]: For program point L5120(line 5120) no Hoare annotation was computed. [2022-07-13 23:03:27,527 INFO L895 garLoopResultBuilder]: At program point L4856-1(lines 4856 4891) the Hoare annotation is: false [2022-07-13 23:03:27,527 INFO L899 garLoopResultBuilder]: For program point L4856(lines 4856 4891) no Hoare annotation was computed. [2022-07-13 23:03:27,527 INFO L899 garLoopResultBuilder]: For program point L4691(lines 4690 4711) no Hoare annotation was computed. [2022-07-13 23:03:27,527 INFO L899 garLoopResultBuilder]: For program point L4724(lines 4724 4727) no Hoare annotation was computed. [2022-07-13 23:03:27,527 INFO L895 garLoopResultBuilder]: At program point L5187(line 5187) the Hoare annotation is: false [2022-07-13 23:03:27,528 INFO L895 garLoopResultBuilder]: At program point L5022loopEntry(lines 5022 5043) the Hoare annotation is: false [2022-07-13 23:03:27,528 INFO L899 garLoopResultBuilder]: For program point L5088(lines 5088 5133) no Hoare annotation was computed. [2022-07-13 23:03:27,528 INFO L899 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2022-07-13 23:03:27,528 INFO L899 garLoopResultBuilder]: For program point L5320(lines 5320 5380) no Hoare annotation was computed. [2022-07-13 23:03:27,528 INFO L899 garLoopResultBuilder]: For program point usb_kill_urbEXIT(lines 5660 5662) no Hoare annotation was computed. [2022-07-13 23:03:27,528 INFO L902 garLoopResultBuilder]: At program point usb_kill_urbENTRY(lines 5660 5662) the Hoare annotation is: true [2022-07-13 23:03:27,528 INFO L899 garLoopResultBuilder]: For program point usb_kill_urbFINAL(lines 5660 5662) no Hoare annotation was computed. [2022-07-13 23:03:27,528 INFO L902 garLoopResultBuilder]: At program point spinlock_checkENTRY(lines 3349 3354) the Hoare annotation is: true [2022-07-13 23:03:27,529 INFO L899 garLoopResultBuilder]: For program point spinlock_checkEXIT(lines 3349 3354) no Hoare annotation was computed. [2022-07-13 23:03:27,529 INFO L899 garLoopResultBuilder]: For program point spinlock_checkFINAL(lines 3349 3354) no Hoare annotation was computed. [2022-07-13 23:03:27,529 INFO L902 garLoopResultBuilder]: At program point L5649(lines 5648 5650) the Hoare annotation is: true [2022-07-13 23:03:27,529 INFO L899 garLoopResultBuilder]: For program point imon_exitEXIT(lines 5252 5261) no Hoare annotation was computed. [2022-07-13 23:03:27,529 INFO L902 garLoopResultBuilder]: At program point imon_exitENTRY(lines 5252 5261) the Hoare annotation is: true [2022-07-13 23:03:27,529 INFO L899 garLoopResultBuilder]: For program point imon_exitFINAL(lines 5252 5261) no Hoare annotation was computed. [2022-07-13 23:03:27,529 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 5396 5401) the Hoare annotation is: true [2022-07-13 23:03:27,530 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 5396 5401) no Hoare annotation was computed. [2022-07-13 23:03:27,530 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 5396 5401) no Hoare annotation was computed. [2022-07-13 23:03:27,530 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5399) no Hoare annotation was computed. [2022-07-13 23:03:27,530 INFO L899 garLoopResultBuilder]: For program point L3611(lines 3611 3616) no Hoare annotation was computed. [2022-07-13 23:03:27,530 INFO L899 garLoopResultBuilder]: For program point L3608(lines 3608 3633) no Hoare annotation was computed. [2022-07-13 23:03:27,530 INFO L899 garLoopResultBuilder]: For program point L3611-2(lines 3611 3616) no Hoare annotation was computed. [2022-07-13 23:03:27,530 INFO L902 garLoopResultBuilder]: At program point L5557(lines 5556 5558) the Hoare annotation is: true [2022-07-13 23:03:27,531 INFO L899 garLoopResultBuilder]: For program point lirc_buffer_freeEXIT(lines 3602 3636) no Hoare annotation was computed. [2022-07-13 23:03:27,531 INFO L902 garLoopResultBuilder]: At program point lirc_buffer_freeENTRY(lines 3602 3636) the Hoare annotation is: true [2022-07-13 23:03:27,531 INFO L899 garLoopResultBuilder]: For program point L3623(lines 3623 3629) no Hoare annotation was computed. [2022-07-13 23:03:27,531 INFO L899 garLoopResultBuilder]: For program point L3623-2(lines 3602 3636) no Hoare annotation was computed. [2022-07-13 23:03:27,534 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-13 23:03:27,536 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 23:03:27,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:03:27 BoogieIcfgContainer [2022-07-13 23:03:27,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 23:03:27,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 23:03:27,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 23:03:27,562 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 23:03:27,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:52" (3/4) ... [2022-07-13 23:03:27,566 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 23:03:27,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2022-07-13 23:03:27,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-07-13 23:03:27,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2022-07-13 23:03:27,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_submit_urb [2022-07-13 23:03:27,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_match_id [2022-07-13 23:03:27,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2022-07-13 23:03:27,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-07-13 23:03:27,573 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-07-13 23:03:27,573 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-07-13 23:03:27,573 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure deregister_from_lirc [2022-07-13 23:03:27,573 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock_nested [2022-07-13 23:03:27,573 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-07-13 23:03:27,573 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __init_waitqueue_head [2022-07-13 23:03:27,573 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-07-13 23:03:27,573 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure imon_init [2022-07-13 23:03:27,573 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-07-13 23:03:27,574 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2022-07-13 23:03:27,574 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_imon_context [2022-07-13 23:03:27,574 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-13 23:03:27,574 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2022-07-13 23:03:27,574 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_kill_urb [2022-07-13 23:03:27,574 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2022-07-13 23:03:27,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure imon_exit [2022-07-13 23:03:27,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-07-13 23:03:27,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lirc_buffer_free [2022-07-13 23:03:27,603 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 183 nodes and edges [2022-07-13 23:03:27,605 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2022-07-13 23:03:27,607 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-13 23:03:27,609 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 23:03:27,611 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-13 23:03:27,613 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 23:03:27,615 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 23:03:27,617 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 23:03:27,647 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-13 23:03:27,648 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-13 23:03:27,807 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 23:03:27,808 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 23:03:27,809 INFO L158 Benchmark]: Toolchain (without parser) took 38899.76ms. Allocated memory was 115.3MB in the beginning and 572.5MB in the end (delta: 457.2MB). Free memory was 76.2MB in the beginning and 501.4MB in the end (delta: -425.2MB). Peak memory consumption was 367.6MB. Max. memory is 16.1GB. [2022-07-13 23:03:27,813 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 23:03:27,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1227.34ms. Allocated memory is still 115.3MB. Free memory was 76.2MB in the beginning and 44.6MB in the end (delta: 31.6MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2022-07-13 23:03:27,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 145.67ms. Allocated memory is still 115.3MB. Free memory was 44.6MB in the beginning and 67.8MB in the end (delta: -23.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-13 23:03:27,814 INFO L158 Benchmark]: Boogie Preprocessor took 134.44ms. Allocated memory is still 115.3MB. Free memory was 67.8MB in the beginning and 58.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 23:03:27,814 INFO L158 Benchmark]: RCFGBuilder took 1880.69ms. Allocated memory was 115.3MB in the beginning and 148.9MB in the end (delta: 33.6MB). Free memory was 58.8MB in the beginning and 55.2MB in the end (delta: 3.6MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2022-07-13 23:03:27,815 INFO L158 Benchmark]: TraceAbstraction took 35255.49ms. Allocated memory was 148.9MB in the beginning and 572.5MB in the end (delta: 423.6MB). Free memory was 55.2MB in the beginning and 200.0MB in the end (delta: -144.9MB). Peak memory consumption was 320.6MB. Max. memory is 16.1GB. [2022-07-13 23:03:27,817 INFO L158 Benchmark]: Witness Printer took 246.23ms. Allocated memory is still 572.5MB. Free memory was 200.0MB in the beginning and 501.4MB in the end (delta: -301.4MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-07-13 23:03:27,823 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.18ms. Allocated memory is still 83.9MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1227.34ms. Allocated memory is still 115.3MB. Free memory was 76.2MB in the beginning and 44.6MB in the end (delta: 31.6MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 145.67ms. Allocated memory is still 115.3MB. Free memory was 44.6MB in the beginning and 67.8MB in the end (delta: -23.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.44ms. Allocated memory is still 115.3MB. Free memory was 67.8MB in the beginning and 58.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1880.69ms. Allocated memory was 115.3MB in the beginning and 148.9MB in the end (delta: 33.6MB). Free memory was 58.8MB in the beginning and 55.2MB in the end (delta: 3.6MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * TraceAbstraction took 35255.49ms. Allocated memory was 148.9MB in the beginning and 572.5MB in the end (delta: 423.6MB). Free memory was 55.2MB in the beginning and 200.0MB in the end (delta: -144.9MB). Peak memory consumption was 320.6MB. Max. memory is 16.1GB. * Witness Printer took 246.23ms. Allocated memory is still 572.5MB. Free memory was 200.0MB in the beginning and 501.4MB in the end (delta: -301.4MB). Peak memory consumption was 32.3MB. 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: 35.2s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5745 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5199 mSDsluCounter, 25339 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15270 mSDsCounter, 1145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4035 IncrementalHoareTripleChecker+Invalid, 5180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1145 mSolverCounterUnsat, 10069 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.8s 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: 1.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 2770 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 146 LocationsWithAnnotation, 3544 PreInvPairs, 3598 NumberOfFragments, 935 HoareAnnotationTreeSize, 3544 FomulaSimplifications, 372 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 146 FomulaSimplificationsInter, 267799 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 6.4s 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-13 23:03:27,903 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