./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 35987657 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-?-3598765 [2022-07-21 09:57:06,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:57:06,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:57:06,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:57:07,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:57:07,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:57:07,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:57:07,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:57:07,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:57:07,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:57:07,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:57:07,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:57:07,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:57:07,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:57:07,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:57:07,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:57:07,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:57:07,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:57:07,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:57:07,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:57:07,040 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:57:07,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:57:07,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:57:07,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:57:07,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:57:07,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:57:07,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:57:07,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:57:07,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:57:07,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:57:07,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:57:07,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:57:07,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:57:07,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:57:07,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:57:07,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:57:07,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:57:07,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:57:07,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:57:07,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:57:07,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:57:07,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:57:07,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:57:07,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:57:07,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:57:07,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:57:07,113 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:57:07,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:57:07,114 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:57:07,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:57:07,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:57:07,115 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:57:07,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:57:07,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:57:07,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:57:07,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:57:07,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:57:07,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:57:07,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:57:07,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:57:07,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:57:07,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:57:07,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:57:07,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:57:07,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:57:07,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:57:07,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:57:07,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:57:07,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:57:07,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:57:07,118 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:57:07,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:57:07,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:57:07,118 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-21 09:57:07,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:57:07,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:57:07,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:57:07,463 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:57:07,463 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:57:07,466 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-21 09:57:07,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd088b73/8dafa1661eed4a8f837b828a907a4dbf/FLAGb51b8cef1 [2022-07-21 09:57:08,272 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:57:08,273 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-21 09:57:08,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd088b73/8dafa1661eed4a8f837b828a907a4dbf/FLAGb51b8cef1 [2022-07-21 09:57:08,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd088b73/8dafa1661eed4a8f837b828a907a4dbf [2022-07-21 09:57:08,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:57:08,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:57:08,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:57:08,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:57:08,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:57:08,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:57:08" (1/1) ... [2022-07-21 09:57:08,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@285ba523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:08, skipping insertion in model container [2022-07-21 09:57:08,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:57:08" (1/1) ... [2022-07-21 09:57:08,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:57:08,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:57:09,591 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-21 09:57:09,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:57:09,686 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:57:09,897 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-21 09:57:09,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:57:09,988 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:57:10,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10 WrapperNode [2022-07-21 09:57:10,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:57:10,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:57:10,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:57:10,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:57:10,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,157 INFO L137 Inliner]: procedures = 121, calls = 866, calls flagged for inlining = 46, calls inlined = 30, statements flattened = 1605 [2022-07-21 09:57:10,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:57:10,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:57:10,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:57:10,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:57:10,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:57:10,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:57:10,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:57:10,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:57:10,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (1/1) ... [2022-07-21 09:57:10,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:57:10,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:10,313 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-21 09:57:10,324 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-21 09:57:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 09:57:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-21 09:57:10,359 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-21 09:57:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-21 09:57:10,360 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-21 09:57:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure usb_match_id [2022-07-21 09:57:10,360 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_match_id [2022-07-21 09:57:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:57:10,361 INFO L130 BoogieDeclarations]: Found specification of procedure imon_init [2022-07-21 09:57:10,361 INFO L138 BoogieDeclarations]: Found implementation of procedure imon_init [2022-07-21 09:57:10,361 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 09:57:10,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 09:57:10,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 09:57:10,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 09:57:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 09:57:10,362 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 09:57:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure imon_exit [2022-07-21 09:57:10,363 INFO L138 BoogieDeclarations]: Found implementation of procedure imon_exit [2022-07-21 09:57:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-07-21 09:57:10,363 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-07-21 09:57:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 09:57:10,363 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 09:57:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:57:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-21 09:57:10,364 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-21 09:57:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-21 09:57:10,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-21 09:57:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure free_imon_context [2022-07-21 09:57:10,364 INFO L138 BoogieDeclarations]: Found implementation of procedure free_imon_context [2022-07-21 09:57:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:57:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-21 09:57:10,365 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-21 09:57:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure lirc_buffer_free [2022-07-21 09:57:10,365 INFO L138 BoogieDeclarations]: Found implementation of procedure lirc_buffer_free [2022-07-21 09:57:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:57:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:57:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:57:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure deregister_from_lirc [2022-07-21 09:57:10,367 INFO L138 BoogieDeclarations]: Found implementation of procedure deregister_from_lirc [2022-07-21 09:57:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:57:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-21 09:57:10,367 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-21 09:57:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-21 09:57:10,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-21 09:57:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:57:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:57:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 09:57:10,369 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 09:57:10,369 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 09:57:10,369 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 09:57:10,369 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-21 09:57:10,369 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-21 09:57:10,369 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-21 09:57:10,370 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-21 09:57:10,370 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-21 09:57:10,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-21 09:57:10,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-21 09:57:10,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-21 09:57:10,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:57:10,373 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-21 09:57:10,374 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-21 09:57:10,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:57:10,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:57:10,786 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:57:10,790 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:57:11,023 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-21 09:57:11,144 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:57:12,188 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume !false; [2022-07-21 09:57:12,189 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume false; [2022-07-21 09:57:12,213 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:57:12,222 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:57:12,222 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2022-07-21 09:57:12,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:57:12 BoogieIcfgContainer [2022-07-21 09:57:12,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:57:12,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:57:12,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:57:12,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:57:12,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:57:08" (1/3) ... [2022-07-21 09:57:12,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50562555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:57:12, skipping insertion in model container [2022-07-21 09:57:12,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:57:10" (2/3) ... [2022-07-21 09:57:12,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50562555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:57:12, skipping insertion in model container [2022-07-21 09:57:12,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:57:12" (3/3) ... [2022-07-21 09:57:12,233 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-staging-lirc-lirc_imon.ko.cil.out.i [2022-07-21 09:57:12,246 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:57:12,247 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:57:12,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:57:12,306 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@51d3b753, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b11b938 [2022-07-21 09:57:12,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:57:12,313 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-21 09:57:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 09:57:12,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:12,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:12,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1796219403, now seen corresponding path program 1 times [2022-07-21 09:57:12,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:12,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758889688] [2022-07-21 09:57:12,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:12,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:12,916 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-21 09:57:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:12,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758889688] [2022-07-21 09:57:12,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758889688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:12,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:12,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:57:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210443881] [2022-07-21 09:57:12,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:12,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:12,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:57:12,964 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-21 09:57:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:13,124 INFO L93 Difference]: Finished difference Result 1009 states and 1523 transitions. [2022-07-21 09:57:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:13,127 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-21 09:57:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:13,144 INFO L225 Difference]: With dead ends: 1009 [2022-07-21 09:57:13,151 INFO L226 Difference]: Without dead ends: 664 [2022-07-21 09:57:13,160 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-21 09:57:13,169 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-21 09:57:13,170 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-21 09:57:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-07-21 09:57:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2022-07-21 09:57:13,286 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-21 09:57:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 876 transitions. [2022-07-21 09:57:13,302 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 876 transitions. Word has length 16 [2022-07-21 09:57:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:13,303 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 876 transitions. [2022-07-21 09:57:13,303 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-21 09:57:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 876 transitions. [2022-07-21 09:57:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 09:57:13,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:13,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:57:13,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:57:13,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash 151566468, now seen corresponding path program 1 times [2022-07-21 09:57:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:13,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466741246] [2022-07-21 09:57:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,572 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-21 09:57:13,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:13,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466741246] [2022-07-21 09:57:13,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466741246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:13,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:13,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:57:13,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692820507] [2022-07-21 09:57:13,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:13,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:13,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:13,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:13,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:57:13,580 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-21 09:57:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:13,621 INFO L93 Difference]: Finished difference Result 663 states and 877 transitions. [2022-07-21 09:57:13,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:13,622 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-21 09:57:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:13,633 INFO L225 Difference]: With dead ends: 663 [2022-07-21 09:57:13,633 INFO L226 Difference]: Without dead ends: 652 [2022-07-21 09:57:13,635 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-21 09:57:13,637 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-21 09:57:13,638 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-21 09:57:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-07-21 09:57:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2022-07-21 09:57:13,672 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-21 09:57:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 863 transitions. [2022-07-21 09:57:13,677 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 863 transitions. Word has length 17 [2022-07-21 09:57:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:13,678 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-21 09:57:13,678 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-21 09:57:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 863 transitions. [2022-07-21 09:57:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 09:57:13,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:13,682 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-21 09:57:13,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:57:13,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash -785836700, now seen corresponding path program 1 times [2022-07-21 09:57:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:13,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364497853] [2022-07-21 09:57:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:13,945 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-21 09:57:13,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:13,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364497853] [2022-07-21 09:57:13,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364497853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:13,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:13,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:57:13,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520961952] [2022-07-21 09:57:13,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:13,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:57:13,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:13,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:57:13,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:57:13,947 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-21 09:57:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:14,523 INFO L93 Difference]: Finished difference Result 1480 states and 2016 transitions. [2022-07-21 09:57:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:57:14,524 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-21 09:57:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:14,529 INFO L225 Difference]: With dead ends: 1480 [2022-07-21 09:57:14,529 INFO L226 Difference]: Without dead ends: 840 [2022-07-21 09:57:14,535 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-21 09:57:14,540 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-21 09:57:14,541 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-21 09:57:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-07-21 09:57:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 666. [2022-07-21 09:57:14,575 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-21 09:57:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 877 transitions. [2022-07-21 09:57:14,579 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 877 transitions. Word has length 45 [2022-07-21 09:57:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:14,580 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 877 transitions. [2022-07-21 09:57:14,580 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-21 09:57:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 877 transitions. [2022-07-21 09:57:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-21 09:57:14,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:14,589 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-21 09:57:14,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:57:14,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:14,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash 156110253, now seen corresponding path program 1 times [2022-07-21 09:57:14,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:14,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440725830] [2022-07-21 09:57:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:14,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 09:57:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 09:57:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 09:57:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 09:57:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:57:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:57:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:14,842 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-21 09:57:14,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:14,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440725830] [2022-07-21 09:57:14,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440725830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:14,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:14,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:57:14,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689599040] [2022-07-21 09:57:14,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:14,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:57:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:57:14,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:57:14,846 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-21 09:57:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:15,294 INFO L93 Difference]: Finished difference Result 1392 states and 1856 transitions. [2022-07-21 09:57:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:57:15,294 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-21 09:57:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:15,298 INFO L225 Difference]: With dead ends: 1392 [2022-07-21 09:57:15,298 INFO L226 Difference]: Without dead ends: 737 [2022-07-21 09:57:15,300 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-21 09:57:15,301 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 267 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 812 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-21 09:57:15,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 812 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:57:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-07-21 09:57:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 691. [2022-07-21 09:57:15,323 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-21 09:57:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 911 transitions. [2022-07-21 09:57:15,327 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 911 transitions. Word has length 81 [2022-07-21 09:57:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:15,328 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 911 transitions. [2022-07-21 09:57:15,328 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-21 09:57:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 911 transitions. [2022-07-21 09:57:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-21 09:57:15,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:15,329 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-21 09:57:15,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:57:15,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:15,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:15,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1773089863, now seen corresponding path program 1 times [2022-07-21 09:57:15,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:15,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419337361] [2022-07-21 09:57:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:15,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:15,775 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-21 09:57:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:15,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419337361] [2022-07-21 09:57:15,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419337361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:15,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554092426] [2022-07-21 09:57:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:15,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:15,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:15,783 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-21 09:57:15,814 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-21 09:57:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:16,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 2443 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:57:16,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:16,411 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-21 09:57:16,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:16,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554092426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:16,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:16,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-21 09:57:16,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117271200] [2022-07-21 09:57:16,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:16,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:16,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:16,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:16,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:57:16,414 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-21 09:57:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:16,512 INFO L93 Difference]: Finished difference Result 1547 states and 2086 transitions. [2022-07-21 09:57:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:16,513 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-21 09:57:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:16,517 INFO L225 Difference]: With dead ends: 1547 [2022-07-21 09:57:16,518 INFO L226 Difference]: Without dead ends: 868 [2022-07-21 09:57:16,520 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-21 09:57:16,521 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:16,521 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.1s Time] [2022-07-21 09:57:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-07-21 09:57:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 703. [2022-07-21 09:57:16,548 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-21 09:57:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 925 transitions. [2022-07-21 09:57:16,552 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 925 transitions. Word has length 80 [2022-07-21 09:57:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:16,553 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 925 transitions. [2022-07-21 09:57:16,553 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-21 09:57:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 925 transitions. [2022-07-21 09:57:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-21 09:57:16,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:16,555 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-21 09:57:16,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 09:57:16,768 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-21 09:57:16,769 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1761414966, now seen corresponding path program 1 times [2022-07-21 09:57:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:16,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555768577] [2022-07-21 09:57:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:16,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:57:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:57:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,206 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-21 09:57:17,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:17,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555768577] [2022-07-21 09:57:17,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555768577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:17,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923394473] [2022-07-21 09:57:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:17,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:17,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:17,209 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-21 09:57:17,216 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-21 09:57:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:17,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 2596 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:57:17,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:17,838 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-21 09:57:17,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:17,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923394473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:17,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:17,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-21 09:57:17,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100359152] [2022-07-21 09:57:17,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:17,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:17,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:17,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:17,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:57:17,840 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-21 09:57:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:17,912 INFO L93 Difference]: Finished difference Result 1571 states and 2114 transitions. [2022-07-21 09:57:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:17,912 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-21 09:57:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:17,917 INFO L225 Difference]: With dead ends: 1571 [2022-07-21 09:57:17,917 INFO L226 Difference]: Without dead ends: 880 [2022-07-21 09:57:17,919 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-21 09:57:17,920 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-21 09:57:17,921 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-21 09:57:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-21 09:57:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 711. [2022-07-21 09:57:17,948 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-21 09:57:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 933 transitions. [2022-07-21 09:57:17,975 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 933 transitions. Word has length 112 [2022-07-21 09:57:17,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:17,975 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 933 transitions. [2022-07-21 09:57:17,975 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-21 09:57:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 933 transitions. [2022-07-21 09:57:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-21 09:57:17,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:17,982 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-21 09:57:18,014 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-21 09:57:18,203 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-21 09:57:18,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:18,204 INFO L85 PathProgramCache]: Analyzing trace with hash -616076705, now seen corresponding path program 1 times [2022-07-21 09:57:18,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:18,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075896067] [2022-07-21 09:57:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:18,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:57:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:57:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:57:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:57:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:57:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:57:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:57:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:18,454 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-21 09:57:18,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:18,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075896067] [2022-07-21 09:57:18,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075896067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:18,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206310263] [2022-07-21 09:57:18,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:18,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:18,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:18,456 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-21 09:57:18,458 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-21 09:57:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 09:57:19,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:19,097 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-21 09:57:19,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:19,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206310263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:19,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:19,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-21 09:57:19,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080763477] [2022-07-21 09:57:19,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:19,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:57:19,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:19,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:57:19,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:19,099 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-21 09:57:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:19,136 INFO L93 Difference]: Finished difference Result 1414 states and 1857 transitions. [2022-07-21 09:57:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:57:19,137 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-21 09:57:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:19,140 INFO L225 Difference]: With dead ends: 1414 [2022-07-21 09:57:19,140 INFO L226 Difference]: Without dead ends: 711 [2022-07-21 09:57:19,142 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-21 09:57:19,143 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-21 09:57:19,143 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-21 09:57:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-07-21 09:57:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2022-07-21 09:57:19,183 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-21 09:57:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 932 transitions. [2022-07-21 09:57:19,187 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 932 transitions. Word has length 121 [2022-07-21 09:57:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:19,188 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 932 transitions. [2022-07-21 09:57:19,188 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-21 09:57:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 932 transitions. [2022-07-21 09:57:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-21 09:57:19,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:19,190 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-21 09:57:19,218 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-21 09:57:19,411 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-21 09:57:19,412 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1762617218, now seen corresponding path program 1 times [2022-07-21 09:57:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:19,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404272765] [2022-07-21 09:57:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:57:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:57:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:57:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:57:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:57:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:57:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:57:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:19,671 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-21 09:57:19,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:19,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404272765] [2022-07-21 09:57:19,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404272765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:19,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518945782] [2022-07-21 09:57:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:19,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:19,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:19,673 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-21 09:57:19,674 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-21 09:57:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 2605 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 09:57:20,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:20,302 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-21 09:57:20,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:20,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518945782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:20,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:20,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-21 09:57:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600671974] [2022-07-21 09:57:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:20,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:57:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:57:20,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:57:20,305 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-21 09:57:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:20,475 INFO L93 Difference]: Finished difference Result 1456 states and 1910 transitions. [2022-07-21 09:57:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:57:20,476 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-21 09:57:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:20,480 INFO L225 Difference]: With dead ends: 1456 [2022-07-21 09:57:20,480 INFO L226 Difference]: Without dead ends: 734 [2022-07-21 09:57:20,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:57:20,483 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-21 09:57:20,484 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-21 09:57:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-07-21 09:57:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 712. [2022-07-21 09:57:20,516 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-21 09:57:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 924 transitions. [2022-07-21 09:57:20,521 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 924 transitions. Word has length 121 [2022-07-21 09:57:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:20,521 INFO L495 AbstractCegarLoop]: Abstraction has 712 states and 924 transitions. [2022-07-21 09:57:20,522 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-21 09:57:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 924 transitions. [2022-07-21 09:57:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 09:57:20,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:20,524 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-21 09:57:20,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 09:57:20,739 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-21 09:57:20,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash -267357553, now seen corresponding path program 1 times [2022-07-21 09:57:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:20,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775946246] [2022-07-21 09:57:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:20,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:57:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:57:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 09:57:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 09:57:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,132 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-21 09:57:21,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:21,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775946246] [2022-07-21 09:57:21,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775946246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:21,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344234521] [2022-07-21 09:57:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:21,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:21,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:21,134 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-21 09:57:21,135 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-21 09:57:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:21,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:57:21,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:21,793 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-21 09:57:21,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:21,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344234521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:21,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:21,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-21 09:57:21,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032191796] [2022-07-21 09:57:21,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:21,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:57:21,795 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-21 09:57:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:21,885 INFO L93 Difference]: Finished difference Result 947 states and 1262 transitions. [2022-07-21 09:57:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:21,886 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-21 09:57:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:21,890 INFO L225 Difference]: With dead ends: 947 [2022-07-21 09:57:21,890 INFO L226 Difference]: Without dead ends: 891 [2022-07-21 09:57:21,890 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-21 09:57:21,891 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-21 09:57:21,891 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-21 09:57:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-07-21 09:57:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 715. [2022-07-21 09:57:21,919 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-21 09:57:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 927 transitions. [2022-07-21 09:57:21,923 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 927 transitions. Word has length 135 [2022-07-21 09:57:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:21,923 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 927 transitions. [2022-07-21 09:57:21,923 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-21 09:57:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 927 transitions. [2022-07-21 09:57:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-21 09:57:21,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:21,925 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-21 09:57:21,959 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-21 09:57:22,151 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-21 09:57:22,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash 238024164, now seen corresponding path program 1 times [2022-07-21 09:57:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:22,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609113389] [2022-07-21 09:57:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:57:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:57:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 09:57:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 09:57:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:57:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:22,513 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-21 09:57:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:22,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609113389] [2022-07-21 09:57:22,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609113389] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:22,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856286658] [2022-07-21 09:57:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:22,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:22,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:22,515 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-21 09:57:22,516 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-21 09:57:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:57:23,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:23,196 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-21 09:57:23,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:23,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856286658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:23,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:23,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-21 09:57:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155320092] [2022-07-21 09:57:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:23,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:23,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:23,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:57:23,200 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-21 09:57:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:23,286 INFO L93 Difference]: Finished difference Result 952 states and 1269 transitions. [2022-07-21 09:57:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:23,287 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-21 09:57:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:23,292 INFO L225 Difference]: With dead ends: 952 [2022-07-21 09:57:23,292 INFO L226 Difference]: Without dead ends: 896 [2022-07-21 09:57:23,293 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-21 09:57:23,293 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-21 09:57:23,294 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-21 09:57:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-21 09:57:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 717. [2022-07-21 09:57:23,326 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-21 09:57:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 929 transitions. [2022-07-21 09:57:23,329 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 929 transitions. Word has length 153 [2022-07-21 09:57:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:23,330 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 929 transitions. [2022-07-21 09:57:23,330 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-21 09:57:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 929 transitions. [2022-07-21 09:57:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-21 09:57:23,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:23,333 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-21 09:57:23,367 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-21 09:57:23,547 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-21 09:57:23,547 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1047500121, now seen corresponding path program 1 times [2022-07-21 09:57:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:23,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106964986] [2022-07-21 09:57:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:57:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:57:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 09:57:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 09:57:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:57:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 09:57:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:23,978 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-21 09:57:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:23,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106964986] [2022-07-21 09:57:23,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106964986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498449439] [2022-07-21 09:57:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:23,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:23,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:23,981 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-21 09:57:23,982 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-21 09:57:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:24,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 2923 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:57:24,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:24,706 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-21 09:57:24,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:24,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498449439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:24,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:24,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-21 09:57:24,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268707482] [2022-07-21 09:57:24,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:24,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:24,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:24,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:24,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:57:24,709 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-21 09:57:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:24,782 INFO L93 Difference]: Finished difference Result 956 states and 1274 transitions. [2022-07-21 09:57:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:24,783 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-21 09:57:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:24,788 INFO L225 Difference]: With dead ends: 956 [2022-07-21 09:57:24,788 INFO L226 Difference]: Without dead ends: 900 [2022-07-21 09:57:24,789 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-21 09:57:24,789 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-21 09:57:24,790 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-21 09:57:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-07-21 09:57:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 719. [2022-07-21 09:57:24,827 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-21 09:57:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 931 transitions. [2022-07-21 09:57:24,831 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 931 transitions. Word has length 171 [2022-07-21 09:57:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:24,831 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 931 transitions. [2022-07-21 09:57:24,831 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-21 09:57:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 931 transitions. [2022-07-21 09:57:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-21 09:57:24,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:24,836 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-21 09:57:24,869 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-21 09:57:25,051 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-21 09:57:25,052 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash 674277908, now seen corresponding path program 1 times [2022-07-21 09:57:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:25,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385215182] [2022-07-21 09:57:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:57:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:57:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 09:57:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 09:57:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:57:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 09:57:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:25,448 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-21 09:57:25,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:25,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385215182] [2022-07-21 09:57:25,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385215182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:25,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624726445] [2022-07-21 09:57:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:25,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:25,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:25,451 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-21 09:57:25,453 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-21 09:57:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 2924 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:57:26,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:26,203 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-21 09:57:26,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:26,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624726445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:26,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:26,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-21 09:57:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593850106] [2022-07-21 09:57:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:26,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:26,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:26,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:57:26,206 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-21 09:57:26,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:26,283 INFO L93 Difference]: Finished difference Result 1647 states and 2176 transitions. [2022-07-21 09:57:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:26,284 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-21 09:57:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:26,289 INFO L225 Difference]: With dead ends: 1647 [2022-07-21 09:57:26,289 INFO L226 Difference]: Without dead ends: 940 [2022-07-21 09:57:26,291 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-21 09:57:26,293 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-21 09:57:26,293 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-21 09:57:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-07-21 09:57:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 779. [2022-07-21 09:57:26,337 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-21 09:57:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1009 transitions. [2022-07-21 09:57:26,341 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1009 transitions. Word has length 172 [2022-07-21 09:57:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:26,341 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1009 transitions. [2022-07-21 09:57:26,342 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-21 09:57:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1009 transitions. [2022-07-21 09:57:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 09:57:26,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:26,344 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-21 09:57:26,379 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-21 09:57:26,559 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-21 09:57:26,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:26,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1219298443, now seen corresponding path program 1 times [2022-07-21 09:57:26,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:26,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208424700] [2022-07-21 09:57:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:26,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:57:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 09:57:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:57:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:57:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 09:57:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:57:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 09:57:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 09:57:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:26,902 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-21 09:57:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208424700] [2022-07-21 09:57:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208424700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667968917] [2022-07-21 09:57:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:26,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:26,905 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-21 09:57:26,906 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-21 09:57:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:27,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 2767 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:57:27,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:27,646 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-21 09:57:27,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:27,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667968917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:27,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:27,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-07-21 09:57:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776233790] [2022-07-21 09:57:27,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:27,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:27,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:57:27,648 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-21 09:57:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:27,732 INFO L93 Difference]: Finished difference Result 1721 states and 2265 transitions. [2022-07-21 09:57:27,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:27,733 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-21 09:57:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:27,737 INFO L225 Difference]: With dead ends: 1721 [2022-07-21 09:57:27,737 INFO L226 Difference]: Without dead ends: 939 [2022-07-21 09:57:27,739 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-21 09:57:27,740 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-21 09:57:27,740 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-21 09:57:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-21 09:57:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 780. [2022-07-21 09:57:27,781 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-21 09:57:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1005 transitions. [2022-07-21 09:57:27,784 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1005 transitions. Word has length 157 [2022-07-21 09:57:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:27,784 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1005 transitions. [2022-07-21 09:57:27,784 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-21 09:57:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1005 transitions. [2022-07-21 09:57:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-21 09:57:27,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:27,787 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-21 09:57:27,818 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-21 09:57:28,000 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-21 09:57:28,000 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1524066826, now seen corresponding path program 1 times [2022-07-21 09:57:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:28,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536671249] [2022-07-21 09:57:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:57:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 09:57:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 09:57:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:57:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 09:57:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 09:57:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:28,387 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-21 09:57:28,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:28,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536671249] [2022-07-21 09:57:28,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536671249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:28,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782863575] [2022-07-21 09:57:28,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:28,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:28,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:28,390 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-21 09:57:28,403 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-21 09:57:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 2964 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:57:29,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:29,111 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-21 09:57:29,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:29,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782863575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:29,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:29,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-21 09:57:29,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403354469] [2022-07-21 09:57:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:29,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:57:29,113 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-21 09:57:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:29,185 INFO L93 Difference]: Finished difference Result 2019 states and 2670 transitions. [2022-07-21 09:57:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:29,186 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-21 09:57:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:29,191 INFO L225 Difference]: With dead ends: 2019 [2022-07-21 09:57:29,191 INFO L226 Difference]: Without dead ends: 1227 [2022-07-21 09:57:29,193 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-21 09:57:29,194 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-21 09:57:29,194 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-21 09:57:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-07-21 09:57:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 832. [2022-07-21 09:57:29,239 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-21 09:57:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1072 transitions. [2022-07-21 09:57:29,242 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1072 transitions. Word has length 188 [2022-07-21 09:57:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:29,242 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1072 transitions. [2022-07-21 09:57:29,243 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-21 09:57:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1072 transitions. [2022-07-21 09:57:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-21 09:57:29,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:29,246 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-21 09:57:29,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-21 09:57:29,459 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-21 09:57:29,459 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:29,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash 450945966, now seen corresponding path program 1 times [2022-07-21 09:57:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:29,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437977167] [2022-07-21 09:57:29,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 09:57:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 09:57:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 09:57:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 09:57:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 09:57:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 09:57:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:29,823 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-21 09:57:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:29,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437977167] [2022-07-21 09:57:29,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437977167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:29,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450434555] [2022-07-21 09:57:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:29,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:29,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:29,825 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-21 09:57:29,827 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-21 09:57:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:30,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 2966 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 09:57:30,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:30,566 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-21 09:57:30,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:30,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450434555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:30,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:30,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-21 09:57:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263432262] [2022-07-21 09:57:30,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:30,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:30,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:30,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:30,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:57:30,570 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-21 09:57:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:30,651 INFO L93 Difference]: Finished difference Result 2185 states and 2888 transitions. [2022-07-21 09:57:30,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:30,652 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-21 09:57:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:30,658 INFO L225 Difference]: With dead ends: 2185 [2022-07-21 09:57:30,658 INFO L226 Difference]: Without dead ends: 1345 [2022-07-21 09:57:30,662 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-21 09:57:30,663 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-21 09:57:30,664 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-21 09:57:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-07-21 09:57:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 931. [2022-07-21 09:57:30,722 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-21 09:57:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1203 transitions. [2022-07-21 09:57:30,725 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1203 transitions. Word has length 191 [2022-07-21 09:57:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:30,725 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1203 transitions. [2022-07-21 09:57:30,725 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-21 09:57:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1203 transitions. [2022-07-21 09:57:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-21 09:57:30,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:30,728 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-21 09:57:30,759 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-21 09:57:30,955 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-21 09:57:30,956 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1205651782, now seen corresponding path program 1 times [2022-07-21 09:57:30,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:30,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538726323] [2022-07-21 09:57:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:30,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:57:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:57:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:57:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 09:57:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:57:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 09:57:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:31,314 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-21 09:57:31,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:31,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538726323] [2022-07-21 09:57:31,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538726323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:31,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706224334] [2022-07-21 09:57:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:31,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:31,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:31,320 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-21 09:57:31,379 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-21 09:57:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 2968 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 09:57:32,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:32,143 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-21 09:57:32,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:32,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706224334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:32,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:32,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-21 09:57:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411549604] [2022-07-21 09:57:32,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:32,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:57:32,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:57:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:57:32,147 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-21 09:57:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:32,290 INFO L93 Difference]: Finished difference Result 1911 states and 2490 transitions. [2022-07-21 09:57:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:57:32,292 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-21 09:57:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:32,296 INFO L225 Difference]: With dead ends: 1911 [2022-07-21 09:57:32,297 INFO L226 Difference]: Without dead ends: 992 [2022-07-21 09:57:32,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-21 09:57:32,299 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 181 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:32,300 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.0s Time] [2022-07-21 09:57:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-07-21 09:57:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 883. [2022-07-21 09:57:32,347 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-21 09:57:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1132 transitions. [2022-07-21 09:57:32,349 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1132 transitions. Word has length 194 [2022-07-21 09:57:32,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:32,350 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1132 transitions. [2022-07-21 09:57:32,350 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-21 09:57:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1132 transitions. [2022-07-21 09:57:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-21 09:57:32,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:32,352 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-21 09:57:32,385 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-21 09:57:32,567 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-21 09:57:32,568 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1391975651, now seen corresponding path program 1 times [2022-07-21 09:57:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:32,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568864222] [2022-07-21 09:57:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:57:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:57:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:57:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 09:57:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:57:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 09:57:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 09:57:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:32,904 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-21 09:57:32,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:32,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568864222] [2022-07-21 09:57:32,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568864222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:32,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497502281] [2022-07-21 09:57:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:32,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:32,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:32,906 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-21 09:57:32,908 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-21 09:57:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:33,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 2922 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:57:33,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:33,623 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-21 09:57:33,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:33,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497502281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:33,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:57:33,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-21 09:57:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848539042] [2022-07-21 09:57:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:33,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:33,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:57:33,626 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-21 09:57:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:33,689 INFO L93 Difference]: Finished difference Result 1774 states and 2281 transitions. [2022-07-21 09:57:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:33,691 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-21 09:57:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:33,697 INFO L225 Difference]: With dead ends: 1774 [2022-07-21 09:57:33,697 INFO L226 Difference]: Without dead ends: 896 [2022-07-21 09:57:33,699 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-21 09:57:33,700 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-21 09:57:33,700 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-21 09:57:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-21 09:57:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 880. [2022-07-21 09:57:33,742 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-21 09:57:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1128 transitions. [2022-07-21 09:57:33,744 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1128 transitions. Word has length 192 [2022-07-21 09:57:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:33,744 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1128 transitions. [2022-07-21 09:57:33,744 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-21 09:57:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1128 transitions. [2022-07-21 09:57:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-21 09:57:33,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:33,748 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-21 09:57:33,783 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-21 09:57:33,971 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-21 09:57:33,972 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash -978025145, now seen corresponding path program 1 times [2022-07-21 09:57:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:33,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004184965] [2022-07-21 09:57:33,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:57:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:57:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:57:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 09:57:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:57:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 09:57:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:57:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 09:57:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:34,328 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-21 09:57:34,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:34,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004184965] [2022-07-21 09:57:34,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004184965] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:57:34,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453162538] [2022-07-21 09:57:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:34,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:34,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:34,330 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-21 09:57:34,332 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-21 09:57:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:35,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 2967 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 09:57:35,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:35,296 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-21 09:57:35,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:57:35,652 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-21 09:57:35,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453162538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:57:35,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:57:35,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 7] total 19 [2022-07-21 09:57:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54669121] [2022-07-21 09:57:35,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:57:35,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 09:57:35,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:35,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 09:57:35,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:57:35,655 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-21 09:57:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:39,182 INFO L93 Difference]: Finished difference Result 2336 states and 3024 transitions. [2022-07-21 09:57:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 09:57:39,183 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-21 09:57:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:39,192 INFO L225 Difference]: With dead ends: 2336 [2022-07-21 09:57:39,192 INFO L226 Difference]: Without dead ends: 1466 [2022-07-21 09:57:39,195 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-21 09:57:39,195 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 1804 mSDsluCounter, 5368 mSDsCounter, 0 mSdLazyCounter, 3094 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1876 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 3954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 3094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:39,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1876 Valid, 6021 Invalid, 3954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 3094 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 09:57:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-07-21 09:57:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1392. [2022-07-21 09:57:39,282 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-21 09:57:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1809 transitions. [2022-07-21 09:57:39,287 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1809 transitions. Word has length 194 [2022-07-21 09:57:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:39,287 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1809 transitions. [2022-07-21 09:57:39,288 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-21 09:57:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1809 transitions. [2022-07-21 09:57:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-21 09:57:39,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:39,291 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-21 09:57:39,328 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-21 09:57:39,507 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-21 09:57:39,508 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:39,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1754849822, now seen corresponding path program 1 times [2022-07-21 09:57:39,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:39,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608046827] [2022-07-21 09:57:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:39,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:57:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:57:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:57:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 09:57:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:57:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:57:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:57:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 09:57:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 09:57:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:57:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 09:57:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 09:57:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 09:57:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 09:57:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 09:57:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:39,824 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-21 09:57:39,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:39,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608046827] [2022-07-21 09:57:39,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608046827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:39,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:39,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:57:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274653326] [2022-07-21 09:57:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:39,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:57:39,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:39,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:57:39,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:57:39,828 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-21 09:57:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:40,279 INFO L93 Difference]: Finished difference Result 2832 states and 3690 transitions. [2022-07-21 09:57:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:57:40,280 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-21 09:57:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:40,286 INFO L225 Difference]: With dead ends: 2832 [2022-07-21 09:57:40,287 INFO L226 Difference]: Without dead ends: 1446 [2022-07-21 09:57:40,290 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-21 09:57:40,290 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 94 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:40,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1014 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:57:40,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2022-07-21 09:57:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1376. [2022-07-21 09:57:40,364 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-21 09:57:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1790 transitions. [2022-07-21 09:57:40,368 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1790 transitions. Word has length 198 [2022-07-21 09:57:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:40,369 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 1790 transitions. [2022-07-21 09:57:40,369 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-21 09:57:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1790 transitions. [2022-07-21 09:57:40,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-21 09:57:40,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:40,372 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-21 09:57:40,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 09:57:40,373 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:40,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash 913659289, now seen corresponding path program 1 times [2022-07-21 09:57:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:40,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867041440] [2022-07-21 09:57:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:40,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 09:57:40,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353558541] [2022-07-21 09:57:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:40,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:40,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:40,488 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-21 09:57:40,516 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-21 09:57:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:41,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 2982 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 09:57:41,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:41,356 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-21 09:57:41,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:41,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867041440] [2022-07-21 09:57:41,357 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 09:57:41,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353558541] [2022-07-21 09:57:41,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353558541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:41,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:41,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:57:41,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36390916] [2022-07-21 09:57:41,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:41,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:41,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:41,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:57:41,359 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-21 09:57:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:41,821 INFO L93 Difference]: Finished difference Result 1671 states and 2222 transitions. [2022-07-21 09:57:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:41,836 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-21 09:57:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:41,844 INFO L225 Difference]: With dead ends: 1671 [2022-07-21 09:57:41,844 INFO L226 Difference]: Without dead ends: 1633 [2022-07-21 09:57:41,845 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-21 09:57:41,846 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 119 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:57:41,846 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.4s Time] [2022-07-21 09:57:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-07-21 09:57:41,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1376. [2022-07-21 09:57:41,951 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-21 09:57:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1788 transitions. [2022-07-21 09:57:41,955 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1788 transitions. Word has length 201 [2022-07-21 09:57:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:41,955 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 1788 transitions. [2022-07-21 09:57:41,956 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-21 09:57:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1788 transitions. [2022-07-21 09:57:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-21 09:57:41,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:57:41,958 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-21 09:57:41,992 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-21 09:57:42,171 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-21 09:57:42,172 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:57:42,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:57:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1938080626, now seen corresponding path program 1 times [2022-07-21 09:57:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:57:42,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668483994] [2022-07-21 09:57:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:57:42,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 09:57:42,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809769408] [2022-07-21 09:57:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:57:42,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:57:42,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:57:42,253 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-21 09:57:42,254 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-21 09:57:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:57:43,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 09:57:43,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:57:43,091 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-21 09:57:43,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:57:43,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:57:43,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668483994] [2022-07-21 09:57:43,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 09:57:43,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809769408] [2022-07-21 09:57:43,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809769408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:57:43,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:57:43,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:57:43,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434139320] [2022-07-21 09:57:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:57:43,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:57:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:57:43,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:57:43,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:57:43,096 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-21 09:57:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:57:43,119 INFO L93 Difference]: Finished difference Result 1470 states and 1895 transitions. [2022-07-21 09:57:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:57:43,120 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-21 09:57:43,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:57:43,120 INFO L225 Difference]: With dead ends: 1470 [2022-07-21 09:57:43,120 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 09:57:43,123 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-21 09:57:43,124 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-21 09:57:43,124 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-21 09:57:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 09:57:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 09:57:43,125 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-21 09:57:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 09:57:43,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-07-21 09:57:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:57:43,126 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 09:57:43,126 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-21 09:57:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 09:57:43,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 09:57:43,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 09:57:43,164 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-21 09:57:43,343 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-21 09:57:43,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 09:57:46,607 INFO L899 garLoopResultBuilder]: For program point usb_fill_int_urbFINAL(lines 3484 3507) no Hoare annotation was computed. [2022-07-21 09:57:46,608 INFO L899 garLoopResultBuilder]: For program point L3499(lines 3499 3503) no Hoare annotation was computed. [2022-07-21 09:57:46,608 INFO L899 garLoopResultBuilder]: For program point L3496(lines 3496 3503) no Hoare annotation was computed. [2022-07-21 09:57:46,608 INFO L899 garLoopResultBuilder]: For program point L3499-2(lines 3496 3503) no Hoare annotation was computed. [2022-07-21 09:57:46,608 INFO L899 garLoopResultBuilder]: For program point usb_fill_int_urbEXIT(lines 3484 3507) no Hoare annotation was computed. [2022-07-21 09:57:46,609 INFO L902 garLoopResultBuilder]: At program point usb_fill_int_urbENTRY(lines 3484 3507) the Hoare annotation is: true [2022-07-21 09:57:46,609 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 5686 5688) no Hoare annotation was computed. [2022-07-21 09:57:46,609 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-21 09:57:46,609 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 5686 5688) no Hoare annotation was computed. [2022-07-21 09:57:46,609 INFO L899 garLoopResultBuilder]: For program point usb_get_intfdataEXIT(lines 3440 3448) no Hoare annotation was computed. [2022-07-21 09:57:46,609 INFO L902 garLoopResultBuilder]: At program point usb_get_intfdataENTRY(lines 3440 3448) the Hoare annotation is: true [2022-07-21 09:57:46,609 INFO L899 garLoopResultBuilder]: For program point usb_get_intfdataFINAL(lines 3440 3448) no Hoare annotation was computed. [2022-07-21 09:57:46,609 INFO L899 garLoopResultBuilder]: For program point L5604-1(line 5604) no Hoare annotation was computed. [2022-07-21 09:57:46,610 INFO L902 garLoopResultBuilder]: At program point L5604-2(lines 5603 5605) the Hoare annotation is: true [2022-07-21 09:57:46,610 INFO L902 garLoopResultBuilder]: At program point L5604(line 5604) the Hoare annotation is: true [2022-07-21 09:57:46,610 INFO L899 garLoopResultBuilder]: For program point usb_submit_urbFINAL(lines 5675 5677) no Hoare annotation was computed. [2022-07-21 09:57:46,610 INFO L899 garLoopResultBuilder]: For program point usb_submit_urbEXIT(lines 5675 5677) no Hoare annotation was computed. [2022-07-21 09:57:46,610 INFO L902 garLoopResultBuilder]: At program point usb_submit_urbENTRY(lines 5675 5677) the Hoare annotation is: true [2022-07-21 09:57:46,610 INFO L899 garLoopResultBuilder]: For program point L5664-1(line 5664) no Hoare annotation was computed. [2022-07-21 09:57:46,610 INFO L899 garLoopResultBuilder]: For program point usb_match_idFINAL(lines 5663 5665) no Hoare annotation was computed. [2022-07-21 09:57:46,611 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-21 09:57:46,611 INFO L899 garLoopResultBuilder]: For program point usb_match_idEXIT(lines 5663 5665) no Hoare annotation was computed. [2022-07-21 09:57:46,611 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-21 09:57:46,611 INFO L902 garLoopResultBuilder]: At program point mutex_unlockENTRY(lines 5641 5643) the Hoare annotation is: true [2022-07-21 09:57:46,611 INFO L899 garLoopResultBuilder]: For program point mutex_unlockEXIT(lines 5641 5643) no Hoare annotation was computed. [2022-07-21 09:57:46,611 INFO L899 garLoopResultBuilder]: For program point mutex_unlockFINAL(lines 5641 5643) no Hoare annotation was computed. [2022-07-21 09:57:46,611 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-21 09:57:46,612 INFO L899 garLoopResultBuilder]: For program point L3420-1(line 3420) no Hoare annotation was computed. [2022-07-21 09:57:46,612 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3416 3424) no Hoare annotation was computed. [2022-07-21 09:57:46,612 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-21 09:57:46,612 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3416 3424) no Hoare annotation was computed. [2022-07-21 09:57:46,612 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 5405 5411) the Hoare annotation is: true [2022-07-21 09:57:46,612 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 5405 5411) no Hoare annotation was computed. [2022-07-21 09:57:46,612 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-21 09:57:46,613 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-21 09:57:46,613 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 3405 3414) no Hoare annotation was computed. [2022-07-21 09:57:46,613 INFO L899 garLoopResultBuilder]: For program point L5575-1(line 5575) no Hoare annotation was computed. [2022-07-21 09:57:46,613 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 3405 3414) no Hoare annotation was computed. [2022-07-21 09:57:46,614 INFO L902 garLoopResultBuilder]: At program point L5575-2(lines 5574 5576) the Hoare annotation is: true [2022-07-21 09:57:46,614 INFO L902 garLoopResultBuilder]: At program point L5633(lines 5632 5634) the Hoare annotation is: true [2022-07-21 09:57:46,614 INFO L899 garLoopResultBuilder]: For program point deregister_from_lircEXIT(lines 3903 3923) no Hoare annotation was computed. [2022-07-21 09:57:46,614 INFO L899 garLoopResultBuilder]: For program point L3911(lines 3911 3920) no Hoare annotation was computed. [2022-07-21 09:57:46,614 INFO L902 garLoopResultBuilder]: At program point deregister_from_lircENTRY(lines 3903 3923) the Hoare annotation is: true [2022-07-21 09:57:46,616 INFO L899 garLoopResultBuilder]: For program point L3911-2(lines 3903 3923) no Hoare annotation was computed. [2022-07-21 09:57:46,616 INFO L899 garLoopResultBuilder]: For program point mutex_lock_nestedFINAL(lines 5638 5640) no Hoare annotation was computed. [2022-07-21 09:57:46,616 INFO L902 garLoopResultBuilder]: At program point mutex_lock_nestedENTRY(lines 5638 5640) the Hoare annotation is: true [2022-07-21 09:57:46,616 INFO L899 garLoopResultBuilder]: For program point mutex_lock_nestedEXIT(lines 5638 5640) no Hoare annotation was computed. [2022-07-21 09:57:46,616 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3451 3459) the Hoare annotation is: true [2022-07-21 09:57:46,616 INFO L902 garLoopResultBuilder]: At program point L5612(lines 5611 5613) the Hoare annotation is: true [2022-07-21 09:57:46,617 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3451 3459) no Hoare annotation was computed. [2022-07-21 09:57:46,617 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3451 3459) no Hoare annotation was computed. [2022-07-21 09:57:46,617 INFO L902 garLoopResultBuilder]: At program point __init_waitqueue_headENTRY(lines 5549 5551) the Hoare annotation is: true [2022-07-21 09:57:46,617 INFO L899 garLoopResultBuilder]: For program point __init_waitqueue_headFINAL(lines 5549 5551) no Hoare annotation was computed. [2022-07-21 09:57:46,617 INFO L899 garLoopResultBuilder]: For program point __init_waitqueue_headEXIT(lines 5549 5551) no Hoare annotation was computed. [2022-07-21 09:57:46,617 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 5624 5626) no Hoare annotation was computed. [2022-07-21 09:57:46,617 INFO L899 garLoopResultBuilder]: For program point L5625(line 5625) no Hoare annotation was computed. [2022-07-21 09:57:46,618 INFO L902 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 5624 5626) the Hoare annotation is: true [2022-07-21 09:57:46,618 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 5624 5626) no Hoare annotation was computed. [2022-07-21 09:57:46,618 INFO L899 garLoopResultBuilder]: For program point imon_initEXIT(lines 5234 5250) no Hoare annotation was computed. [2022-07-21 09:57:46,618 INFO L902 garLoopResultBuilder]: At program point L3478(lines 3472 3480) the Hoare annotation is: true [2022-07-21 09:57:46,618 INFO L899 garLoopResultBuilder]: For program point L5241(lines 5241 5247) no Hoare annotation was computed. [2022-07-21 09:57:46,618 INFO L902 garLoopResultBuilder]: At program point L5672(lines 5671 5673) the Hoare annotation is: true [2022-07-21 09:57:46,618 INFO L902 garLoopResultBuilder]: At program point imon_initENTRY(lines 5234 5250) the Hoare annotation is: true [2022-07-21 09:57:46,618 INFO L899 garLoopResultBuilder]: For program point imon_initFINAL(lines 5234 5250) no Hoare annotation was computed. [2022-07-21 09:57:46,619 INFO L902 garLoopResultBuilder]: At program point L5504loopEntry(lines 5504 5523) the Hoare annotation is: true [2022-07-21 09:57:46,619 INFO L899 garLoopResultBuilder]: For program point L5513(lines 5513 5518) no Hoare annotation was computed. [2022-07-21 09:57:46,619 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 5500 5529) no Hoare annotation was computed. [2022-07-21 09:57:46,619 INFO L902 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 5500 5529) the Hoare annotation is: true [2022-07-21 09:57:46,619 INFO L899 garLoopResultBuilder]: For program point L5505(lines 5504 5523) no Hoare annotation was computed. [2022-07-21 09:57:46,619 INFO L902 garLoopResultBuilder]: At program point L5524(lines 5500 5529) the Hoare annotation is: true [2022-07-21 09:57:46,619 INFO L899 garLoopResultBuilder]: For program point L5516-1(lines 5513 5518) no Hoare annotation was computed. [2022-07-21 09:57:46,619 INFO L902 garLoopResultBuilder]: At program point L5516(line 5516) the Hoare annotation is: true [2022-07-21 09:57:46,620 INFO L899 garLoopResultBuilder]: For program point L5506(lines 5504 5523) no Hoare annotation was computed. [2022-07-21 09:57:46,620 INFO L902 garLoopResultBuilder]: At program point L5508(line 5508) the Hoare annotation is: true [2022-07-21 09:57:46,620 INFO L902 garLoopResultBuilder]: At program point __create_pipeENTRY(lines 3515 3520) the Hoare annotation is: true [2022-07-21 09:57:46,620 INFO L899 garLoopResultBuilder]: For program point __create_pipeFINAL(lines 3515 3520) no Hoare annotation was computed. [2022-07-21 09:57:46,620 INFO L899 garLoopResultBuilder]: For program point __create_pipeEXIT(lines 3515 3520) no Hoare annotation was computed. [2022-07-21 09:57:46,620 INFO L899 garLoopResultBuilder]: For program point L3871-1(line 3871) no Hoare annotation was computed. [2022-07-21 09:57:46,620 INFO L902 garLoopResultBuilder]: At program point L3871(line 3871) the Hoare annotation is: true [2022-07-21 09:57:46,621 INFO L899 garLoopResultBuilder]: For program point L3869-1(line 3869) no Hoare annotation was computed. [2022-07-21 09:57:46,621 INFO L902 garLoopResultBuilder]: At program point L3869(line 3869) the Hoare annotation is: true [2022-07-21 09:57:46,621 INFO L899 garLoopResultBuilder]: For program point L3867-1(line 3867) no Hoare annotation was computed. [2022-07-21 09:57:46,621 INFO L902 garLoopResultBuilder]: At program point L3867(line 3867) the Hoare annotation is: true [2022-07-21 09:57:46,621 INFO L899 garLoopResultBuilder]: For program point free_imon_contextEXIT(lines 3861 3902) no Hoare annotation was computed. [2022-07-21 09:57:46,621 INFO L899 garLoopResultBuilder]: For program point L3876(lines 3875 3896) no Hoare annotation was computed. [2022-07-21 09:57:46,621 INFO L902 garLoopResultBuilder]: At program point L3872(line 3872) the Hoare annotation is: true [2022-07-21 09:57:46,621 INFO L902 garLoopResultBuilder]: At program point free_imon_contextENTRY(lines 3861 3902) the Hoare annotation is: true [2022-07-21 09:57:46,622 INFO L902 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: true [2022-07-21 09:57:46,622 INFO L902 garLoopResultBuilder]: At program point L3872-1(lines 3872 3896) the Hoare annotation is: true [2022-07-21 09:57:46,623 INFO L902 garLoopResultBuilder]: At program point L3868(line 3868) the Hoare annotation is: true [2022-07-21 09:57:46,623 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-07-21 09:57:46,623 INFO L899 garLoopResultBuilder]: For program point L3868-1(line 3868) no Hoare annotation was computed. [2022-07-21 09:57:46,623 INFO L902 garLoopResultBuilder]: At program point L3897(lines 3861 3902) the Hoare annotation is: true [2022-07-21 09:57:46,623 INFO L899 garLoopResultBuilder]: For program point L3883(lines 3883 3889) no Hoare annotation was computed. [2022-07-21 09:57:46,623 INFO L899 garLoopResultBuilder]: For program point L3879(line 3879) no Hoare annotation was computed. [2022-07-21 09:57:46,623 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-21 09:57:46,624 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5569 5573) no Hoare annotation was computed. [2022-07-21 09:57:46,624 INFO L899 garLoopResultBuilder]: For program point L5571(line 5571) no Hoare annotation was computed. [2022-07-21 09:57:46,624 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5569 5573) no Hoare annotation was computed. [2022-07-21 09:57:46,624 INFO L902 garLoopResultBuilder]: At program point usb_alloc_urbENTRY(lines 5474 5498) the Hoare annotation is: true [2022-07-21 09:57:46,624 INFO L899 garLoopResultBuilder]: For program point usb_alloc_urbFINAL(lines 5474 5498) no Hoare annotation was computed. [2022-07-21 09:57:46,624 INFO L899 garLoopResultBuilder]: For program point L5493(lines 5478 5494) no Hoare annotation was computed. [2022-07-21 09:57:46,624 INFO L899 garLoopResultBuilder]: For program point L5482(line 5482) no Hoare annotation was computed. [2022-07-21 09:57:46,624 INFO L899 garLoopResultBuilder]: For program point L5485(lines 5485 5488) no Hoare annotation was computed. [2022-07-21 09:57:46,625 INFO L902 garLoopResultBuilder]: At program point L5479loopEntry(lines 5479 5492) the Hoare annotation is: true [2022-07-21 09:57:46,625 INFO L902 garLoopResultBuilder]: At program point L5480(line 5480) the Hoare annotation is: true [2022-07-21 09:57:46,625 INFO L899 garLoopResultBuilder]: For program point usb_alloc_urbEXIT(lines 5474 5498) no Hoare annotation was computed. [2022-07-21 09:57:46,625 INFO L899 garLoopResultBuilder]: For program point L5023(lines 5022 5043) no Hoare annotation was computed. [2022-07-21 09:57:46,625 INFO L895 garLoopResultBuilder]: At program point L4858(line 4858) the Hoare annotation is: false [2022-07-21 09:57:46,626 INFO L895 garLoopResultBuilder]: At program point L4957(lines 4949 4958) the Hoare annotation is: false [2022-07-21 09:57:46,626 INFO L899 garLoopResultBuilder]: For program point L4858-1(line 4858) no Hoare annotation was computed. [2022-07-21 09:57:46,627 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-21 09:57:46,627 INFO L895 garLoopResultBuilder]: At program point L5222(line 5222) the Hoare annotation is: false [2022-07-21 09:57:46,627 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-21 09:57:46,627 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-21 09:57:46,627 INFO L899 garLoopResultBuilder]: For program point L5156-2(lines 5156 5162) no Hoare annotation was computed. [2022-07-21 09:57:46,627 INFO L899 garLoopResultBuilder]: For program point L5222-1(line 5222) no Hoare annotation was computed. [2022-07-21 09:57:46,627 INFO L899 garLoopResultBuilder]: For program point L5156(lines 5156 5162) no Hoare annotation was computed. [2022-07-21 09:57:46,628 INFO L899 garLoopResultBuilder]: For program point L4694(line 4694) no Hoare annotation was computed. [2022-07-21 09:57:46,628 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-21 09:57:46,628 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-21 09:57:46,628 INFO L899 garLoopResultBuilder]: For program point L4661-1(line 4661) no Hoare annotation was computed. [2022-07-21 09:57:46,629 INFO L895 garLoopResultBuilder]: At program point L5652(lines 5651 5653) the Hoare annotation is: false [2022-07-21 09:57:46,629 INFO L899 garLoopResultBuilder]: For program point L5091(lines 5091 5133) no Hoare annotation was computed. [2022-07-21 09:57:46,629 INFO L899 garLoopResultBuilder]: For program point L4860-2(lines 4856 4890) no Hoare annotation was computed. [2022-07-21 09:57:46,629 INFO L899 garLoopResultBuilder]: For program point L4893(line 4893) no Hoare annotation was computed. [2022-07-21 09:57:46,629 INFO L899 garLoopResultBuilder]: For program point L4860(lines 4860 4863) no Hoare annotation was computed. [2022-07-21 09:57:46,629 INFO L895 garLoopResultBuilder]: At program point L5554(lines 5553 5555) the Hoare annotation is: false [2022-07-21 09:57:46,630 INFO L899 garLoopResultBuilder]: For program point L5323(lines 5323 5380) no Hoare annotation was computed. [2022-07-21 09:57:46,631 INFO L899 garLoopResultBuilder]: For program point L5224-1(line 5224) no Hoare annotation was computed. [2022-07-21 09:57:46,633 INFO L895 garLoopResultBuilder]: At program point L5158(line 5158) the Hoare annotation is: false [2022-07-21 09:57:46,633 INFO L895 garLoopResultBuilder]: At program point L5224(line 5224) the Hoare annotation is: false [2022-07-21 09:57:46,633 INFO L899 garLoopResultBuilder]: For program point L5026(line 5026) no Hoare annotation was computed. [2022-07-21 09:57:46,633 INFO L899 garLoopResultBuilder]: For program point L5158-1(line 5158) no Hoare annotation was computed. [2022-07-21 09:57:46,634 INFO L895 garLoopResultBuilder]: At program point L5092(lines 5091 5133) the Hoare annotation is: false [2022-07-21 09:57:46,634 INFO L899 garLoopResultBuilder]: For program point L4828(lines 4828 4834) no Hoare annotation was computed. [2022-07-21 09:57:46,635 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-21 09:57:46,635 INFO L895 garLoopResultBuilder]: At program point L5192-1(lines 5173 5194) the Hoare annotation is: false [2022-07-21 09:57:46,635 INFO L895 garLoopResultBuilder]: At program point L5225(lines 5225 5227) the Hoare annotation is: false [2022-07-21 09:57:46,637 INFO L899 garLoopResultBuilder]: For program point L5225-1(lines 5225 5227) no Hoare annotation was computed. [2022-07-21 09:57:46,638 INFO L895 garLoopResultBuilder]: At program point L5192(line 5192) the Hoare annotation is: false [2022-07-21 09:57:46,638 INFO L899 garLoopResultBuilder]: For program point L4928-1(line 4928) no Hoare annotation was computed. [2022-07-21 09:57:46,638 INFO L895 garLoopResultBuilder]: At program point L4928(line 4928) the Hoare annotation is: false [2022-07-21 09:57:46,638 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-21 09:57:46,638 INFO L899 garLoopResultBuilder]: For program point L4664(lines 4664 4671) no Hoare annotation was computed. [2022-07-21 09:57:46,638 INFO L899 garLoopResultBuilder]: For program point L5094(lines 5094 5133) no Hoare annotation was computed. [2022-07-21 09:57:46,638 INFO L899 garLoopResultBuilder]: For program point L4896(lines 4896 4903) no Hoare annotation was computed. [2022-07-21 09:57:46,638 INFO L899 garLoopResultBuilder]: For program point L4698(lines 4698 4704) no Hoare annotation was computed. [2022-07-21 09:57:46,639 INFO L895 garLoopResultBuilder]: At program point L3575(lines 3555 3576) the Hoare annotation is: false [2022-07-21 09:57:46,639 INFO L899 garLoopResultBuilder]: For program point L5326(lines 5326 5380) no Hoare annotation was computed. [2022-07-21 09:57:46,639 INFO L895 garLoopResultBuilder]: At program point L5095(lines 5070 5133) the Hoare annotation is: false [2022-07-21 09:57:46,639 INFO L899 garLoopResultBuilder]: For program point L4930(lines 4930 4937) no Hoare annotation was computed. [2022-07-21 09:57:46,639 INFO L899 garLoopResultBuilder]: For program point L4996-2(lines 4996 4999) no Hoare annotation was computed. [2022-07-21 09:57:46,639 INFO L899 garLoopResultBuilder]: For program point L4996(lines 4996 4999) no Hoare annotation was computed. [2022-07-21 09:57:46,639 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-21 09:57:46,639 INFO L895 garLoopResultBuilder]: At program point L5393(lines 5286 5395) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-21 09:57:46,639 INFO L899 garLoopResultBuilder]: For program point L5228-1(line 5228) no Hoare annotation was computed. [2022-07-21 09:57:46,640 INFO L895 garLoopResultBuilder]: At program point L5228(line 5228) the Hoare annotation is: false [2022-07-21 09:57:46,640 INFO L899 garLoopResultBuilder]: For program point L5030(lines 5030 5036) no Hoare annotation was computed. [2022-07-21 09:57:46,640 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-21 09:57:46,640 INFO L899 garLoopResultBuilder]: For program point L5658-1(line 5658) no Hoare annotation was computed. [2022-07-21 09:57:46,640 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-21 09:57:46,640 INFO L899 garLoopResultBuilder]: For program point L5196(line 5196) no Hoare annotation was computed. [2022-07-21 09:57:46,640 INFO L895 garLoopResultBuilder]: At program point L5097(lines 5073 5133) the Hoare annotation is: false [2022-07-21 09:57:46,640 INFO L899 garLoopResultBuilder]: For program point L4866(lines 4865 4886) no Hoare annotation was computed. [2022-07-21 09:57:46,640 INFO L899 garLoopResultBuilder]: For program point L4734(line 4734) no Hoare annotation was computed. [2022-07-21 09:57:46,641 INFO L899 garLoopResultBuilder]: For program point L4734-4(line 4734) no Hoare annotation was computed. [2022-07-21 09:57:46,641 INFO L899 garLoopResultBuilder]: For program point L4734-2(line 4734) no Hoare annotation was computed. [2022-07-21 09:57:46,641 INFO L899 garLoopResultBuilder]: For program point L4734-8(line 4734) no Hoare annotation was computed. [2022-07-21 09:57:46,641 INFO L895 garLoopResultBuilder]: At program point L3545loopEntry(lines 3545 3551) the Hoare annotation is: false [2022-07-21 09:57:46,641 INFO L899 garLoopResultBuilder]: For program point L4734-6(line 4734) no Hoare annotation was computed. [2022-07-21 09:57:46,641 INFO L895 garLoopResultBuilder]: At program point L5230(lines 5214 5232) the Hoare annotation is: false [2022-07-21 09:57:46,641 INFO L899 garLoopResultBuilder]: For program point L5329(lines 5329 5380) no Hoare annotation was computed. [2022-07-21 09:57:46,641 INFO L895 garLoopResultBuilder]: At program point L5065(lines 4643 5139) the Hoare annotation is: false [2022-07-21 09:57:46,641 INFO L899 garLoopResultBuilder]: For program point L4735(line 4735) no Hoare annotation was computed. [2022-07-21 09:57:46,641 INFO L899 garLoopResultBuilder]: For program point L4735-4(line 4735) no Hoare annotation was computed. [2022-07-21 09:57:46,642 INFO L899 garLoopResultBuilder]: For program point L4735-2(line 4735) no Hoare annotation was computed. [2022-07-21 09:57:46,642 INFO L895 garLoopResultBuilder]: At program point L3546(line 3546) the Hoare annotation is: false [2022-07-21 09:57:46,642 INFO L899 garLoopResultBuilder]: For program point L4735-8(line 4735) no Hoare annotation was computed. [2022-07-21 09:57:46,642 INFO L899 garLoopResultBuilder]: For program point L4735-6(line 4735) no Hoare annotation was computed. [2022-07-21 09:57:46,642 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-21 09:57:46,642 INFO L895 garLoopResultBuilder]: At program point L5165(line 5165) the Hoare annotation is: false [2022-07-21 09:57:46,642 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-21 09:57:46,643 INFO L899 garLoopResultBuilder]: For program point L5165-1(line 5165) no Hoare annotation was computed. [2022-07-21 09:57:46,643 INFO L899 garLoopResultBuilder]: For program point L4736(lines 4736 4811) no Hoare annotation was computed. [2022-07-21 09:57:46,643 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-21 09:57:46,643 INFO L895 garLoopResultBuilder]: At program point L5199(lines 5141 5201) the Hoare annotation is: false [2022-07-21 09:57:46,643 INFO L899 garLoopResultBuilder]: For program point L5298-1(line 5298) no Hoare annotation was computed. [2022-07-21 09:57:46,643 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-21 09:57:46,643 INFO L895 garLoopResultBuilder]: At program point L5001(line 5001) the Hoare annotation is: false [2022-07-21 09:57:46,644 INFO L899 garLoopResultBuilder]: For program point L5001-1(line 5001) no Hoare annotation was computed. [2022-07-21 09:57:46,644 INFO L899 garLoopResultBuilder]: For program point L4869(line 4869) no Hoare annotation was computed. [2022-07-21 09:57:46,644 INFO L899 garLoopResultBuilder]: For program point L4737(lines 4737 4772) no Hoare annotation was computed. [2022-07-21 09:57:46,644 INFO L895 garLoopResultBuilder]: At program point L5629(lines 5628 5630) the Hoare annotation is: false [2022-07-21 09:57:46,644 INFO L899 garLoopResultBuilder]: For program point L5167(lines 5167 5172) no Hoare annotation was computed. [2022-07-21 09:57:46,644 INFO L895 garLoopResultBuilder]: At program point L5002(lines 5002 5004) the Hoare annotation is: false [2022-07-21 09:57:46,644 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-21 09:57:46,644 INFO L899 garLoopResultBuilder]: For program point L5167-2(lines 5167 5172) no Hoare annotation was computed. [2022-07-21 09:57:46,644 INFO L899 garLoopResultBuilder]: For program point L5002-1(lines 5002 5004) no Hoare annotation was computed. [2022-07-21 09:57:46,644 INFO L899 garLoopResultBuilder]: For program point L4738(lines 4738 4769) no Hoare annotation was computed. [2022-07-21 09:57:46,644 INFO L899 garLoopResultBuilder]: For program point L3582(lines 3582 3590) no Hoare annotation was computed. [2022-07-21 09:57:46,644 INFO L899 garLoopResultBuilder]: For program point L3582-2(lines 3582 3590) no Hoare annotation was computed. [2022-07-21 09:57:46,645 INFO L899 garLoopResultBuilder]: For program point L5300(lines 5300 5303) no Hoare annotation was computed. [2022-07-21 09:57:46,645 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-21 09:57:46,645 INFO L899 garLoopResultBuilder]: For program point L4673-1(line 4673) no Hoare annotation was computed. [2022-07-21 09:57:46,645 INFO L899 garLoopResultBuilder]: For program point L5136(line 5136) no Hoare annotation was computed. [2022-07-21 09:57:46,645 INFO L895 garLoopResultBuilder]: At program point L4905(line 4905) the Hoare annotation is: false [2022-07-21 09:57:46,645 INFO L899 garLoopResultBuilder]: For program point L4905-1(line 4905) no Hoare annotation was computed. [2022-07-21 09:57:46,645 INFO L895 garLoopResultBuilder]: At program point L4939(line 4939) the Hoare annotation is: false [2022-07-21 09:57:46,645 INFO L899 garLoopResultBuilder]: For program point L4939-1(line 4939) no Hoare annotation was computed. [2022-07-21 09:57:46,645 INFO L895 garLoopResultBuilder]: At program point L5005(line 5005) the Hoare annotation is: false [2022-07-21 09:57:46,645 INFO L899 garLoopResultBuilder]: For program point L5005-1(line 5005) no Hoare annotation was computed. [2022-07-21 09:57:46,645 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-21 09:57:46,645 INFO L899 garLoopResultBuilder]: For program point L4873(lines 4873 4879) no Hoare annotation was computed. [2022-07-21 09:57:46,645 INFO L899 garLoopResultBuilder]: For program point L4675(lines 4675 4679) no Hoare annotation was computed. [2022-07-21 09:57:46,646 INFO L895 garLoopResultBuilder]: At program point L3552(lines 3543 3600) the Hoare annotation is: false [2022-07-21 09:57:46,646 INFO L899 garLoopResultBuilder]: For program point L5534(lines 5534 5539) no Hoare annotation was computed. [2022-07-21 09:57:46,646 INFO L899 garLoopResultBuilder]: For program point L4675-2(lines 4675 4679) no Hoare annotation was computed. [2022-07-21 09:57:46,646 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-21 09:57:46,646 INFO L895 garLoopResultBuilder]: At program point L4973(line 4973) the Hoare annotation is: false [2022-07-21 09:57:46,646 INFO L899 garLoopResultBuilder]: For program point L4973-1(line 4973) no Hoare annotation was computed. [2022-07-21 09:57:46,646 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-21 09:57:46,646 INFO L895 garLoopResultBuilder]: At program point L4742loopEntry(lines 4742 4763) the Hoare annotation is: false [2022-07-21 09:57:46,646 INFO L895 garLoopResultBuilder]: At program point L5601(lines 5600 5602) the Hoare annotation is: false [2022-07-21 09:57:46,646 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-21 09:57:46,646 INFO L899 garLoopResultBuilder]: For program point L5007(lines 5007 5015) no Hoare annotation was computed. [2022-07-21 09:57:46,646 INFO L899 garLoopResultBuilder]: For program point L5073(lines 5073 5133) no Hoare annotation was computed. [2022-07-21 09:57:46,646 INFO L899 garLoopResultBuilder]: For program point L4941(lines 4941 4948) no Hoare annotation was computed. [2022-07-21 09:57:46,646 INFO L899 garLoopResultBuilder]: For program point L4908(lines 4908 4915) no Hoare annotation was computed. [2022-07-21 09:57:46,646 INFO L899 garLoopResultBuilder]: For program point L4743(lines 4742 4763) no Hoare annotation was computed. [2022-07-21 09:57:46,646 INFO L899 garLoopResultBuilder]: For program point L4776(lines 4776 4809) no Hoare annotation was computed. [2022-07-21 09:57:46,646 INFO L895 garLoopResultBuilder]: At program point L5668(lines 5667 5669) the Hoare annotation is: false [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L5173(lines 5173 5194) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L4777(lines 4777 4807) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L895 garLoopResultBuilder]: At program point L5537(line 5537) the Hoare annotation is: false [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L5537-1(lines 5533 5547) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L895 garLoopResultBuilder]: At program point L5207(line 5207) the Hoare annotation is: false [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L5207-1(line 5207) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L5174(lines 5174 5189) no Hoare annotation was computed. [2022-07-21 09:57:46,647 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-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L5307(line 5307) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L5340(lines 5340 5343) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L5076(lines 5076 5133) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L4977(lines 4977 4988) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L899 garLoopResultBuilder]: For program point L4746(line 4746) no Hoare annotation was computed. [2022-07-21 09:57:46,647 INFO L895 garLoopResultBuilder]: At program point L3524(lines 3521 3526) the Hoare annotation is: false [2022-07-21 09:57:46,647 INFO L895 garLoopResultBuilder]: At program point L3557(line 3557) the Hoare annotation is: false [2022-07-21 09:57:46,647 INFO L895 garLoopResultBuilder]: At program point L5176-1(line 5176) the Hoare annotation is: false [2022-07-21 09:57:46,648 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-21 09:57:46,648 INFO L895 garLoopResultBuilder]: At program point L5209(line 5209) the Hoare annotation is: false [2022-07-21 09:57:46,648 INFO L899 garLoopResultBuilder]: For program point L5209-1(line 5209) no Hoare annotation was computed. [2022-07-21 09:57:46,648 INFO L895 garLoopResultBuilder]: At program point L5176(line 5176) the Hoare annotation is: false [2022-07-21 09:57:46,648 INFO L895 garLoopResultBuilder]: At program point L5011(line 5011) the Hoare annotation is: false [2022-07-21 09:57:46,648 INFO L895 garLoopResultBuilder]: At program point L5044(lines 5021 5045) the Hoare annotation is: false [2022-07-21 09:57:46,648 INFO L899 garLoopResultBuilder]: For program point L5177(line 5177) no Hoare annotation was computed. [2022-07-21 09:57:46,649 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-21 09:57:46,649 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-21 09:57:46,649 INFO L899 garLoopResultBuilder]: For program point L3559(line 3559) no Hoare annotation was computed. [2022-07-21 09:57:46,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 09:57:46,650 INFO L895 garLoopResultBuilder]: At program point L5211(lines 5202 5213) the Hoare annotation is: false [2022-07-21 09:57:46,650 INFO L899 garLoopResultBuilder]: For program point L5079(lines 5079 5133) no Hoare annotation was computed. [2022-07-21 09:57:46,650 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-21 09:57:46,650 INFO L899 garLoopResultBuilder]: For program point L4782(lines 4781 4802) no Hoare annotation was computed. [2022-07-21 09:57:46,651 INFO L899 garLoopResultBuilder]: For program point L4716(line 4716) no Hoare annotation was computed. [2022-07-21 09:57:46,651 INFO L899 garLoopResultBuilder]: For program point L5311(lines 5311 5316) no Hoare annotation was computed. [2022-07-21 09:57:46,651 INFO L899 garLoopResultBuilder]: For program point L5179(lines 5179 5184) no Hoare annotation was computed. [2022-07-21 09:57:46,651 INFO L899 garLoopResultBuilder]: For program point L4750(lines 4750 4756) no Hoare annotation was computed. [2022-07-21 09:57:46,651 INFO L895 garLoopResultBuilder]: At program point L5543(line 5543) the Hoare annotation is: false [2022-07-21 09:57:46,651 INFO L895 garLoopResultBuilder]: At program point L5543-1(lines 5531 5548) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-21 09:57:46,651 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-21 09:57:46,651 INFO L899 garLoopResultBuilder]: For program point L4817(lines 4817 4846) no Hoare annotation was computed. [2022-07-21 09:57:46,652 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-21 09:57:46,652 INFO L895 garLoopResultBuilder]: At program point L3562loopEntry(lines 3562 3569) the Hoare annotation is: false [2022-07-21 09:57:46,652 INFO L899 garLoopResultBuilder]: For program point L3595(lines 3595 3598) no Hoare annotation was computed. [2022-07-21 09:57:46,652 INFO L899 garLoopResultBuilder]: For program point L3595-2(lines 3595 3598) no Hoare annotation was computed. [2022-07-21 09:57:46,652 INFO L899 garLoopResultBuilder]: For program point L5313(lines 5313 5316) no Hoare annotation was computed. [2022-07-21 09:57:46,652 INFO L899 garLoopResultBuilder]: For program point L5313-1(lines 5311 5316) no Hoare annotation was computed. [2022-07-21 09:57:46,652 INFO L895 garLoopResultBuilder]: At program point L5148-1(line 5148) the Hoare annotation is: false [2022-07-21 09:57:46,653 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 09:57:46,653 INFO L899 garLoopResultBuilder]: For program point L5082(lines 5082 5133) no Hoare annotation was computed. [2022-07-21 09:57:46,653 INFO L895 garLoopResultBuilder]: At program point L5181(line 5181) the Hoare annotation is: false [2022-07-21 09:57:46,653 INFO L895 garLoopResultBuilder]: At program point L5148(line 5148) the Hoare annotation is: false [2022-07-21 09:57:46,653 INFO L895 garLoopResultBuilder]: At program point L4950loopEntry(lines 4950 4956) the Hoare annotation is: false [2022-07-21 09:57:46,653 INFO L899 garLoopResultBuilder]: For program point L4785(line 4785) no Hoare annotation was computed. [2022-07-21 09:57:46,653 INFO L895 garLoopResultBuilder]: At program point L5578(lines 5577 5579) the Hoare annotation is: false [2022-07-21 09:57:46,654 INFO L899 garLoopResultBuilder]: For program point L3563(line 3563) no Hoare annotation was computed. [2022-07-21 09:57:46,654 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-21 09:57:46,654 INFO L899 garLoopResultBuilder]: For program point L5050(lines 5050 5056) no Hoare annotation was computed. [2022-07-21 09:57:46,654 INFO L899 garLoopResultBuilder]: For program point L5149(line 5149) no Hoare annotation was computed. [2022-07-21 09:57:46,654 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-21 09:57:46,654 INFO L899 garLoopResultBuilder]: For program point L4951(line 4951) no Hoare annotation was computed. [2022-07-21 09:57:46,654 INFO L895 garLoopResultBuilder]: At program point L5017(line 5017) the Hoare annotation is: false [2022-07-21 09:57:46,654 INFO L899 garLoopResultBuilder]: For program point L5017-1(line 5017) no Hoare annotation was computed. [2022-07-21 09:57:46,655 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-21 09:57:46,655 INFO L899 garLoopResultBuilder]: For program point L4919(lines 4919 4926) no Hoare annotation was computed. [2022-07-21 09:57:46,655 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-21 09:57:46,655 INFO L899 garLoopResultBuilder]: For program point L4721(lines 4720 4813) no Hoare annotation was computed. [2022-07-21 09:57:46,655 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-21 09:57:46,656 INFO L899 garLoopResultBuilder]: For program point L5019(lines 5019 5060) no Hoare annotation was computed. [2022-07-21 09:57:46,656 INFO L899 garLoopResultBuilder]: For program point L5019-1(lines 5019 5060) no Hoare annotation was computed. [2022-07-21 09:57:46,656 INFO L899 garLoopResultBuilder]: For program point L5085(lines 5085 5133) no Hoare annotation was computed. [2022-07-21 09:57:46,656 INFO L899 garLoopResultBuilder]: For program point L4821(lines 4820 4841) no Hoare annotation was computed. [2022-07-21 09:57:46,656 INFO L895 garLoopResultBuilder]: At program point L3599(lines 3535 3601) the Hoare annotation is: false [2022-07-21 09:57:46,656 INFO L895 garLoopResultBuilder]: At program point L5581(lines 5580 5582) the Hoare annotation is: false [2022-07-21 09:57:46,656 INFO L895 garLoopResultBuilder]: At program point L5152-1(line 5152) the Hoare annotation is: false [2022-07-21 09:57:46,656 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 09:57:46,657 INFO L895 garLoopResultBuilder]: At program point L5152(line 5152) the Hoare annotation is: false [2022-07-21 09:57:46,657 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-21 09:57:46,657 INFO L895 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: false [2022-07-21 09:57:46,657 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-07-21 09:57:46,657 INFO L899 garLoopResultBuilder]: For program point L5020(lines 5020 5058) no Hoare annotation was computed. [2022-07-21 09:57:46,657 INFO L899 garLoopResultBuilder]: For program point L4723(lines 4723 4729) no Hoare annotation was computed. [2022-07-21 09:57:46,657 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-21 09:57:46,658 INFO L899 garLoopResultBuilder]: For program point L4789(lines 4789 4795) no Hoare annotation was computed. [2022-07-21 09:57:46,658 INFO L899 garLoopResultBuilder]: For program point L4723-2(lines 4722 4732) no Hoare annotation was computed. [2022-07-21 09:57:46,658 INFO L895 garLoopResultBuilder]: At program point L3336(lines 3333 3338) the Hoare annotation is: false [2022-07-21 09:57:46,658 INFO L899 garLoopResultBuilder]: For program point L5153(line 5153) no Hoare annotation was computed. [2022-07-21 09:57:46,658 INFO L899 garLoopResultBuilder]: For program point L5120(line 5120) no Hoare annotation was computed. [2022-07-21 09:57:46,658 INFO L895 garLoopResultBuilder]: At program point L4856-1(lines 4856 4891) the Hoare annotation is: false [2022-07-21 09:57:46,658 INFO L899 garLoopResultBuilder]: For program point L4856(lines 4856 4891) no Hoare annotation was computed. [2022-07-21 09:57:46,658 INFO L899 garLoopResultBuilder]: For program point L4691(lines 4690 4711) no Hoare annotation was computed. [2022-07-21 09:57:46,659 INFO L899 garLoopResultBuilder]: For program point L4724(lines 4724 4727) no Hoare annotation was computed. [2022-07-21 09:57:46,659 INFO L895 garLoopResultBuilder]: At program point L5187(line 5187) the Hoare annotation is: false [2022-07-21 09:57:46,659 INFO L895 garLoopResultBuilder]: At program point L5022loopEntry(lines 5022 5043) the Hoare annotation is: false [2022-07-21 09:57:46,659 INFO L899 garLoopResultBuilder]: For program point L5088(lines 5088 5133) no Hoare annotation was computed. [2022-07-21 09:57:46,659 INFO L899 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2022-07-21 09:57:46,659 INFO L899 garLoopResultBuilder]: For program point L5320(lines 5320 5380) no Hoare annotation was computed. [2022-07-21 09:57:46,659 INFO L899 garLoopResultBuilder]: For program point usb_kill_urbEXIT(lines 5660 5662) no Hoare annotation was computed. [2022-07-21 09:57:46,660 INFO L902 garLoopResultBuilder]: At program point usb_kill_urbENTRY(lines 5660 5662) the Hoare annotation is: true [2022-07-21 09:57:46,660 INFO L899 garLoopResultBuilder]: For program point usb_kill_urbFINAL(lines 5660 5662) no Hoare annotation was computed. [2022-07-21 09:57:46,660 INFO L902 garLoopResultBuilder]: At program point spinlock_checkENTRY(lines 3349 3354) the Hoare annotation is: true [2022-07-21 09:57:46,660 INFO L899 garLoopResultBuilder]: For program point spinlock_checkEXIT(lines 3349 3354) no Hoare annotation was computed. [2022-07-21 09:57:46,660 INFO L899 garLoopResultBuilder]: For program point spinlock_checkFINAL(lines 3349 3354) no Hoare annotation was computed. [2022-07-21 09:57:46,660 INFO L902 garLoopResultBuilder]: At program point L5649(lines 5648 5650) the Hoare annotation is: true [2022-07-21 09:57:46,660 INFO L899 garLoopResultBuilder]: For program point imon_exitEXIT(lines 5252 5261) no Hoare annotation was computed. [2022-07-21 09:57:46,661 INFO L902 garLoopResultBuilder]: At program point imon_exitENTRY(lines 5252 5261) the Hoare annotation is: true [2022-07-21 09:57:46,661 INFO L899 garLoopResultBuilder]: For program point imon_exitFINAL(lines 5252 5261) no Hoare annotation was computed. [2022-07-21 09:57:46,661 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 5396 5401) the Hoare annotation is: true [2022-07-21 09:57:46,661 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 5396 5401) no Hoare annotation was computed. [2022-07-21 09:57:46,661 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 5396 5401) no Hoare annotation was computed. [2022-07-21 09:57:46,661 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5399) no Hoare annotation was computed. [2022-07-21 09:57:46,661 INFO L899 garLoopResultBuilder]: For program point L3611(lines 3611 3616) no Hoare annotation was computed. [2022-07-21 09:57:46,661 INFO L899 garLoopResultBuilder]: For program point L3608(lines 3608 3633) no Hoare annotation was computed. [2022-07-21 09:57:46,662 INFO L899 garLoopResultBuilder]: For program point L3611-2(lines 3611 3616) no Hoare annotation was computed. [2022-07-21 09:57:46,662 INFO L902 garLoopResultBuilder]: At program point L5557(lines 5556 5558) the Hoare annotation is: true [2022-07-21 09:57:46,662 INFO L899 garLoopResultBuilder]: For program point lirc_buffer_freeEXIT(lines 3602 3636) no Hoare annotation was computed. [2022-07-21 09:57:46,662 INFO L902 garLoopResultBuilder]: At program point lirc_buffer_freeENTRY(lines 3602 3636) the Hoare annotation is: true [2022-07-21 09:57:46,662 INFO L899 garLoopResultBuilder]: For program point L3623(lines 3623 3629) no Hoare annotation was computed. [2022-07-21 09:57:46,662 INFO L899 garLoopResultBuilder]: For program point L3623-2(lines 3602 3636) no Hoare annotation was computed. [2022-07-21 09:57:46,665 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-21 09:57:46,666 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 09:57:46,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:57:46 BoogieIcfgContainer [2022-07-21 09:57:46,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 09:57:46,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 09:57:46,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 09:57:46,709 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 09:57:46,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:57:12" (3/4) ... [2022-07-21 09:57:46,713 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 09:57:46,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2022-07-21 09:57:46,718 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-07-21 09:57:46,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2022-07-21 09:57:46,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_submit_urb [2022-07-21 09:57:46,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_match_id [2022-07-21 09:57:46,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2022-07-21 09:57:46,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-07-21 09:57:46,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-07-21 09:57:46,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-07-21 09:57:46,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure deregister_from_lirc [2022-07-21 09:57:46,719 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock_nested [2022-07-21 09:57:46,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-07-21 09:57:46,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __init_waitqueue_head [2022-07-21 09:57:46,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-07-21 09:57:46,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure imon_init [2022-07-21 09:57:46,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-07-21 09:57:46,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2022-07-21 09:57:46,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_imon_context [2022-07-21 09:57:46,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-21 09:57:46,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2022-07-21 09:57:46,721 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_kill_urb [2022-07-21 09:57:46,721 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2022-07-21 09:57:46,721 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure imon_exit [2022-07-21 09:57:46,721 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-07-21 09:57:46,721 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lirc_buffer_free [2022-07-21 09:57:46,748 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 183 nodes and edges [2022-07-21 09:57:46,751 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2022-07-21 09:57:46,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-21 09:57:46,755 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-21 09:57:46,756 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-21 09:57:46,757 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-21 09:57:46,759 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 09:57:46,760 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 09:57:46,794 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-21 09:57:46,795 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-21 09:57:46,949 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 09:57:46,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 09:57:46,950 INFO L158 Benchmark]: Toolchain (without parser) took 38450.91ms. Allocated memory was 48.2MB in the beginning and 578.8MB in the end (delta: 530.6MB). Free memory was 27.1MB in the beginning and 448.9MB in the end (delta: -421.8MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2022-07-21 09:57:46,950 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:57:46,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1509.09ms. Allocated memory was 48.2MB in the beginning and 73.4MB in the end (delta: 25.2MB). Free memory was 26.9MB in the beginning and 33.4MB in the end (delta: -6.5MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2022-07-21 09:57:46,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.80ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 33.4MB in the beginning and 61.5MB in the end (delta: -28.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-07-21 09:57:46,951 INFO L158 Benchmark]: Boogie Preprocessor took 113.79ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 52.3MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 09:57:46,951 INFO L158 Benchmark]: RCFGBuilder took 1952.47ms. Allocated memory was 100.7MB in the beginning and 153.1MB in the end (delta: 52.4MB). Free memory was 52.3MB in the beginning and 67.4MB in the end (delta: -15.2MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2022-07-21 09:57:46,951 INFO L158 Benchmark]: TraceAbstraction took 34482.12ms. Allocated memory was 153.1MB in the beginning and 578.8MB in the end (delta: 425.7MB). Free memory was 66.4MB in the beginning and 483.2MB in the end (delta: -416.9MB). Peak memory consumption was 324.5MB. Max. memory is 16.1GB. [2022-07-21 09:57:46,952 INFO L158 Benchmark]: Witness Printer took 240.16ms. Allocated memory is still 578.8MB. Free memory was 483.2MB in the beginning and 448.9MB in the end (delta: 34.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-21 09:57:46,953 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.26ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1509.09ms. Allocated memory was 48.2MB in the beginning and 73.4MB in the end (delta: 25.2MB). Free memory was 26.9MB in the beginning and 33.4MB in the end (delta: -6.5MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 137.80ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 33.4MB in the beginning and 61.5MB in the end (delta: -28.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.79ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 52.3MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1952.47ms. Allocated memory was 100.7MB in the beginning and 153.1MB in the end (delta: 52.4MB). Free memory was 52.3MB in the beginning and 67.4MB in the end (delta: -15.2MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * TraceAbstraction took 34482.12ms. Allocated memory was 153.1MB in the beginning and 578.8MB in the end (delta: 425.7MB). Free memory was 66.4MB in the beginning and 483.2MB in the end (delta: -416.9MB). Peak memory consumption was 324.5MB. Max. memory is 16.1GB. * Witness Printer took 240.16ms. Allocated memory is still 578.8MB. Free memory was 483.2MB in the beginning and 448.9MB in the end (delta: 34.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 5399]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 26 procedures, 350 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.4s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5745 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5199 mSDsluCounter, 25332 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15266 mSDsCounter, 1150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4023 IncrementalHoareTripleChecker+Invalid, 5173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1150 mSolverCounterUnsat, 10066 mSDtfsCounter, 4023 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, 2.1s HoareSimplificationTime, 146 FomulaSimplificationsInter, 267799 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 6.2s 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-21 09:57:47,038 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