/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/ldv-linux-3.14-races/linux-3.14--drivers--net--irda--w83977af_ir.ko.cil.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 14:50:56,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 14:50:56,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 14:50:56,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 14:50:56,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 14:50:56,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 14:50:56,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 14:50:56,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 14:50:56,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 14:50:56,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 14:50:56,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 14:50:56,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 14:50:56,803 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 14:50:56,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 14:50:56,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 14:50:56,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:50:56,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:50:56,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 14:50:56,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 14:50:56,806 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 14:50:56,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 14:50:56,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 14:50:56,807 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 14:50:56,807 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 14:50:56,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 14:50:57,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 14:50:57,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 14:50:57,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 14:50:57,029 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 14:50:57,031 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 14:50:57,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.14-races/linux-3.14--drivers--net--irda--w83977af_ir.ko.cil.i [2025-04-14 14:50:58,334 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fe65eaa/d600dc5960974aed92203a62c3a31387/FLAGaf87c8019 [2025-04-14 14:50:58,816 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 14:50:58,816 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.14-races/linux-3.14--drivers--net--irda--w83977af_ir.ko.cil.i [2025-04-14 14:50:58,853 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fe65eaa/d600dc5960974aed92203a62c3a31387/FLAGaf87c8019 [2025-04-14 14:50:59,534 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fe65eaa/d600dc5960974aed92203a62c3a31387 [2025-04-14 14:50:59,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 14:50:59,537 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 14:50:59,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 14:50:59,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 14:50:59,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 14:50:59,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:50:59" (1/1) ... [2025-04-14 14:50:59,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67dc0278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:59, skipping insertion in model container [2025-04-14 14:50:59,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:50:59" (1/1) ... [2025-04-14 14:50:59,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 14:51:00,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.14-races/linux-3.14--drivers--net--irda--w83977af_ir.ko.cil.i[236326,236339] [2025-04-14 14:51:01,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:51:01,259 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 14:51:01,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5646] [2025-04-14 14:51:01,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5653] [2025-04-14 14:51:01,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [5660] [2025-04-14 14:51:01,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/alpha/git/klever2/klever/native-scheduler-work-dir/scheduler/jobs/d5cd53f56669d61faa91054857893dbd/klever-core-work-dir/lkbce/arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [5694-5695] [2025-04-14 14:51:01,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [5700-5702] [2025-04-14 14:51:01,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [5759] [2025-04-14 14:51:01,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [5767] [2025-04-14 14:51:01,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.14-races/linux-3.14--drivers--net--irda--w83977af_ir.ko.cil.i[236326,236339] [2025-04-14 14:51:01,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:51:01,634 INFO L204 MainTranslator]: Completed translation [2025-04-14 14:51:01,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01 WrapperNode [2025-04-14 14:51:01,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 14:51:01,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 14:51:01,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 14:51:01,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 14:51:01,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:01,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:01,961 INFO L138 Inliner]: procedures = 328, calls = 1288, calls flagged for inlining = 514, calls inlined = 855, statements flattened = 7854 [2025-04-14 14:51:01,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 14:51:01,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 14:51:01,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 14:51:01,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 14:51:01,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:01,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:02,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:02,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:02,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:02,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:02,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:02,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:02,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 14:51:02,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 14:51:02,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 14:51:02,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 14:51:02,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (1/1) ... [2025-04-14 14:51:02,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:51:02,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:51:02,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 14:51:02,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 14:51:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-04-14 14:51:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_random_allocationless_scenario_3 [2025-04-14 14:51:02,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_random_allocationless_scenario_3 [2025-04-14 14:51:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_scenario_2 [2025-04-14 14:51:02,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_scenario_2 [2025-04-14 14:51:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_insmod_4 [2025-04-14 14:51:02,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_insmod_4 [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 14:51:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 14:51:02,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 14:51:02,388 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 14:51:02,861 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 14:51:02,863 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 14:51:04,828 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-6: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-18: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-12: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-24: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-30: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-42: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-36: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-48: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-54: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-66: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-60: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-72: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-78: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-90: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-84: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-96: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-102: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-114: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,829 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-108: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-120: havoc printk_#t~nondet667#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5791: havoc is_device_dma_capable_#t~short34#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5791-1: havoc is_device_dma_capable_#t~mem33#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5791-2: havoc is_device_dma_capable_#t~mem32#1.base, is_device_dma_capable_#t~mem32#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5791-3: havoc is_device_dma_capable_#t~mem31#1.base, is_device_dma_capable_#t~mem31#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5791-16: havoc is_device_dma_capable_#t~short34#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5791-17: havoc is_device_dma_capable_#t~mem33#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5791-18: havoc is_device_dma_capable_#t~mem32#1.base, is_device_dma_capable_#t~mem32#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5791-19: havoc is_device_dma_capable_#t~mem31#1.base, is_device_dma_capable_#t~mem31#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10031: havoc request_dma_#t~nondet672#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10035: havoc net_ratelimit_#t~nondet673#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10035-6: havoc net_ratelimit_#t~nondet673#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10035-12: havoc net_ratelimit_#t~nondet673#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809: havoc get_dma_ops_#t~mem46#1.base, get_dma_ops_#t~mem46#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809-5: havoc get_dma_ops_#t~mem46#1.base, get_dma_ops_#t~mem46#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809-10: havoc get_dma_ops_#t~mem46#1.base, get_dma_ops_#t~mem46#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809-15: havoc get_dma_ops_#t~mem46#1.base, get_dma_ops_#t~mem46#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809-20: havoc get_dma_ops_#t~mem46#1.base, get_dma_ops_#t~mem46#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809-25: havoc get_dma_ops_#t~mem46#1.base, get_dma_ops_#t~mem46#1.offset; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10042: havoc ldv_failed_register_netdev_#t~nondet674#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10042-6: havoc ldv_failed_register_netdev_#t~nondet674#1; [2025-04-14 14:51:04,830 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10045: havoc __request_region_#t~ret675#1.base, __request_region_#t~ret675#1.offset; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10051: havoc alloc_irdadev_#t~ret676#1.base, alloc_irdadev_#t~ret676#1.offset; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10060: havoc irlap_open_#t~ret678#1.base, irlap_open_#t~ret678#1.offset; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L7823: #res#1.base, #res#1.offset := 0, 0; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5710: havoc arch_irqs_disabled_flags_#t~bitwise12#1; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5710-11: havoc arch_irqs_disabled_flags_#t~bitwise12#1; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5710-22: havoc arch_irqs_disabled_flags_#t~bitwise12#1; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5710-33: havoc arch_irqs_disabled_flags_#t~bitwise12#1; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001: havoc netdev_get_tx_queue_#t~mem94#1.base, netdev_get_tx_queue_#t~mem94#1.offset; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001-5: havoc netdev_get_tx_queue_#t~mem94#1.base, netdev_get_tx_queue_#t~mem94#1.offset; [2025-04-14 14:51:04,831 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L7326: havoc w83977af_net_open_~#hwname~0#1.base, w83977af_net_open_~#hwname~0#1.offset; [2025-04-14 14:51:04,832 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L7326-1: SUMMARY for call ULTIMATE.dealloc(w83977af_net_open_~#hwname~0#1.base, w83977af_net_open_~#hwname~0#1.offset); srcloc: null [2025-04-14 14:51:04,832 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L9971: havoc sprintf_#t~nondet664#1; [2025-04-14 14:51:04,832 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6305: havoc w83977af_open_~#__key~0#1.base, w83977af_open_~#__key~0#1.offset; [2025-04-14 14:51:04,832 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6305-1: SUMMARY for call ULTIMATE.dealloc(w83977af_open_~#__key~0#1.base, w83977af_open_~#__key~0#1.offset); srcloc: null [2025-04-14 14:51:06,570 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,570 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-6: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,570 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-18: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,570 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-12: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,570 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-24: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,570 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-30: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,570 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-42: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,570 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-36: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,570 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-48: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-54: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-66: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-60: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-72: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-78: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-90: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-84: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-96: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-102: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-114: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-108: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-120: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-126: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-138: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-132: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-144: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-150: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-162: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-156: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-168: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-174: havoc printk_#t~nondet667#1; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10054: havoc memcpy_#t~ret677#1.base, memcpy_#t~ret677#1.offset; [2025-04-14 14:51:06,571 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10054-9: havoc memcpy_#t~ret677#1.base, memcpy_#t~ret677#1.offset; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10054-18: havoc memcpy_#t~ret677#1.base, memcpy_#t~ret677#1.offset; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10054-27: havoc memcpy_#t~ret677#1.base, memcpy_#t~ret677#1.offset; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10064-6: havoc netpoll_trap_#t~nondet679#1; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10064: havoc netpoll_trap_#t~nondet679#1; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10064-12: havoc netpoll_trap_#t~nondet679#1; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10064-18: havoc netpoll_trap_#t~nondet679#1; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5662-3: test_and_clear_bit_#res#1 := 1; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5662-1: test_and_clear_bit_#res#1 := 1; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5662-7: test_and_clear_bit_#res#1 := 1; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5662-5: test_and_clear_bit_#res#1 := 1; [2025-04-14 14:51:06,572 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001: havoc netdev_get_tx_queue_#t~mem94#1.base, netdev_get_tx_queue_#t~mem94#1.offset; [2025-04-14 14:51:06,573 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001-5: havoc netdev_get_tx_queue_#t~mem94#1.base, netdev_get_tx_queue_#t~mem94#1.offset; [2025-04-14 14:51:06,573 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001-10: havoc netdev_get_tx_queue_#t~mem94#1.base, netdev_get_tx_queue_#t~mem94#1.offset; [2025-04-14 14:51:06,573 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001-15: havoc netdev_get_tx_queue_#t~mem94#1.base, netdev_get_tx_queue_#t~mem94#1.offset; [2025-04-14 14:51:06,573 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L9987: havoc netif_rx_#t~nondet665#1; [2025-04-14 14:51:06,573 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L9987-6: havoc netif_rx_#t~nondet665#1; [2025-04-14 14:51:06,573 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L7887: #res#1.base, #res#1.offset := 0, 0; [2025-04-14 14:51:06,573 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10008: havoc __netdev_alloc_skb_#t~ret666#1.base, __netdev_alloc_skb_#t~ret666#1.offset; [2025-04-14 14:51:06,573 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10008-9: havoc __netdev_alloc_skb_#t~ret666#1.base, __netdev_alloc_skb_#t~ret666#1.offset; [2025-04-14 14:51:06,864 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L7912-1: ldv_main_10_#res#1.base, ldv_main_10_#res#1.offset := 0, 0; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-6: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-18: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-12: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-24: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-30: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-42: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-36: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-48: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-54: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-66: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-60: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-72: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-78: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,715 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-90: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-84: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-96: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-102: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-114: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10012-108: havoc printk_#t~nondet667#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10019: havoc capable_#t~nondet668#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10019-6: havoc capable_#t~nondet668#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5662-3: test_and_clear_bit_#res#1 := 1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L5662-1: test_and_clear_bit_#res#1 := 1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10054: havoc memcpy_#t~ret677#1.base, memcpy_#t~ret677#1.offset; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L7943: #res#1.base, #res#1.offset := 0, 0; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10064-6: havoc netpoll_trap_#t~nondet679#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L10064: havoc netpoll_trap_#t~nondet679#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L9955: havoc async_wrap_skb_#t~nondet663#1; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L7978: #res#1.base, #res#1.offset := 0, 0; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001: havoc netdev_get_tx_queue_#t~mem94#1.base, netdev_get_tx_queue_#t~mem94#1.offset; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001-5: havoc netdev_get_tx_queue_#t~mem94#1.base, netdev_get_tx_queue_#t~mem94#1.offset; [2025-04-14 14:51:07,716 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001-10: havoc netdev_get_tx_queue_#t~mem94#1.base, netdev_get_tx_queue_#t~mem94#1.offset; [2025-04-14 14:51:07,717 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6154: havoc irda_get_mtt_#t~mem125#1; [2025-04-14 14:51:07,717 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6154-1: havoc irda_get_mtt_#t~ite126#1; [2025-04-14 14:51:07,717 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6154-2: havoc irda_get_mtt_#t~mem124#1; [2025-04-14 14:51:07,717 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6162: havoc irda_get_next_speed_#t~mem128#1; [2025-04-14 14:51:07,717 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6162-1: havoc irda_get_next_speed_#t~ite129#1; [2025-04-14 14:51:07,717 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6162-2: havoc irda_get_next_speed_#t~mem127#1; [2025-04-14 14:51:07,718 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 14:51:07,718 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 14:51:11,903 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 14:51:11,904 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 14:51:11,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:51:11 BoogieIcfgContainer [2025-04-14 14:51:11,904 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 14:51:11,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 14:51:11,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 14:51:11,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 14:51:11,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:50:59" (1/3) ... [2025-04-14 14:51:11,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f39e507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:51:11, skipping insertion in model container [2025-04-14 14:51:11,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:51:01" (2/3) ... [2025-04-14 14:51:11,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f39e507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:51:11, skipping insertion in model container [2025-04-14 14:51:11,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:51:11" (3/3) ... [2025-04-14 14:51:11,911 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.14--drivers--net--irda--w83977af_ir.ko.cil.i [2025-04-14 14:51:11,924 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 14:51:11,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.14--drivers--net--irda--w83977af_ir.ko.cil.i that has 4 procedures, 399 locations, 598 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 14:51:11,928 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 14:51:12,663 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2025-04-14 14:51:12,715 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:51:12,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 14:51:12,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:51:12,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 14:51:12,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 14:51:13,180 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 14:51:13,192 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ldv_random_allocationless_scenario_3Thread1of1ForFork1 ======== [2025-04-14 14:51:13,198 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c1b965b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:51:13,198 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 14:58:48,731 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:58:48,731 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:58:48,732 INFO L139 ounterexampleChecker]: Examining path program with hash 1621610494, occurence #1 [2025-04-14 14:58:48,732 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:58:48,732 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:58:48,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:58:48,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1797736180, now seen corresponding path program 1 times [2025-04-14 14:58:48,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:58:48,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764924399] [2025-04-14 14:58:48,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:58:48,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:58:49,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 14:58:49,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 14:58:49,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:58:49,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:58:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:58:49,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:58:49,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764924399] [2025-04-14 14:58:49,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764924399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:58:49,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:58:49,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:58:49,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549399145] [2025-04-14 14:58:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:58:49,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 14:58:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:58:49,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 14:58:49,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 14:58:49,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:58:49,948 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:58:49,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:58:49,949 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:58:53,992 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:58:58,002 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:58:59,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:58:59,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 14:58:59,237 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:58:59,237 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:58:59,237 INFO L139 ounterexampleChecker]: Examining path program with hash 907273786, occurence #1 [2025-04-14 14:58:59,237 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:58:59,237 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:58:59,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:58:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1388325435, now seen corresponding path program 1 times [2025-04-14 14:58:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:58:59,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257514874] [2025-04-14 14:58:59,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:58:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:58:59,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 14:58:59,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 14:58:59,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:58:59,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:59:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:59:00,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:59:00,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257514874] [2025-04-14 14:59:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257514874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:59:00,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001502438] [2025-04-14 14:59:00,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:59:00,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:59:00,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:59:00,109 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) [2025-04-14 14:59:00,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 14:59:01,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 14:59:01,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 14:59:01,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:59:01,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:59:01,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 2575 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 14:59:01,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:59:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:59:01,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:59:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:59:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001502438] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:59:01,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:59:01,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-14 14:59:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899336730] [2025-04-14 14:59:01,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:59:01,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 14:59:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:59:01,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 14:59:01,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 14:59:01,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:59:01,644 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:59:01,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:59:01,644 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:59:01,644 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:59:05,666 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:09,673 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:13,680 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:17,687 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:18,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:59:18,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:18,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 14:59:18,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-14 14:59:18,386 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:59:18,386 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:59:18,386 INFO L139 ounterexampleChecker]: Examining path program with hash 907273786, occurence #2 [2025-04-14 14:59:18,386 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 14:59:18,387 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 14:59:18,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:59:18,431 INFO L85 PathProgramCache]: Analyzing trace with hash 667863, now seen corresponding path program 1 times [2025-04-14 14:59:18,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 14:59:18,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544890684] [2025-04-14 14:59:18,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:59:18,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:59:18,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-14 14:59:18,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-14 14:59:18,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:59:18,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:59:18,992 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 14:59:18,992 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 14:59:18,992 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 14:59:18,992 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,992 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 14:59:18,992 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,992 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 14:59:18,992 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,992 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 14:59:18,993 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,993 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-14 14:59:18,993 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,993 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 14:59:18,993 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,993 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 38 [2025-04-14 14:59:18,993 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,993 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-04-14 14:59:18,993 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,993 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 41 [2025-04-14 14:59:18,993 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,993 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 14:59:18,993 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:18,993 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 14:59:18,993 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:59:18,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:59:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1063598932, now seen corresponding path program 2 times [2025-04-14 14:59:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:59:18,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444756759] [2025-04-14 14:59:18,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:59:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:59:19,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-04-14 14:59:19,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 53 statements. [2025-04-14 14:59:19,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:59:19,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:59:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 14:59:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:59:19,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444756759] [2025-04-14 14:59:19,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444756759] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:59:19,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:59:19,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:59:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547451987] [2025-04-14 14:59:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:59:19,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:59:19,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:59:19,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:59:19,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:59:19,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:59:19,856 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:59:19,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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) [2025-04-14 14:59:19,856 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:59:19,856 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:19,857 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:59:23,877 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:27,883 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:31,891 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:33,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:59:33,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:33,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:33,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2025-04-14 14:59:33,581 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:59:33,581 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:59:33,581 INFO L139 ounterexampleChecker]: Examining path program with hash 1025586016, occurence #1 [2025-04-14 14:59:33,581 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:59:33,581 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:59:33,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:59:33,582 INFO L85 PathProgramCache]: Analyzing trace with hash 614475617, now seen corresponding path program 1 times [2025-04-14 14:59:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:59:33,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118646667] [2025-04-14 14:59:33,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:59:33,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:59:34,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-14 14:59:34,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-14 14:59:34,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:59:34,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:59:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 14:59:34,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:59:34,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118646667] [2025-04-14 14:59:34,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118646667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:59:34,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:59:34,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:59:34,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908974946] [2025-04-14 14:59:34,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:59:34,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:59:34,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:59:34,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:59:34,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:59:34,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:59:34,367 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:59:34,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:59:34,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:59:34,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:34,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:34,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:59:38,388 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:42,392 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:46,395 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:46,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:59:46,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:46,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:46,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:59:46,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 14:59:46,928 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:59:46,928 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:59:46,928 INFO L139 ounterexampleChecker]: Examining path program with hash 1025586016, occurence #2 [2025-04-14 14:59:46,928 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 14:59:46,928 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 14:59:46,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:59:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash 667874, now seen corresponding path program 1 times [2025-04-14 14:59:46,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 14:59:46,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756404702] [2025-04-14 14:59:46,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:59:46,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:59:47,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-14 14:59:47,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-14 14:59:47,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:59:47,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:59:47,511 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 14:59:47,511 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 14:59:47,511 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 14:59:47,511 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 38 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 41 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 14:59:47,512 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:59:47,512 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 14:59:47,512 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:59:47,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:59:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1696514408, now seen corresponding path program 1 times [2025-04-14 14:59:47,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:59:47,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245312108] [2025-04-14 14:59:47,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:59:47,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:59:48,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-14 14:59:48,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-14 14:59:48,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:59:48,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:59:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 14:59:48,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:59:48,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245312108] [2025-04-14 14:59:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245312108] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:59:48,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:59:48,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:59:48,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531704701] [2025-04-14 14:59:48,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:59:48,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:59:48,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:59:48,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:59:48,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:59:48,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:59:48,955 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:59:48,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:59:48,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:59:48,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:48,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:59:48,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:59:48,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:59:52,976 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 14:59:56,982 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:00,992 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:02,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:02,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:02,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:02,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:00:02,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:02,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2025-04-14 15:00:02,168 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:00:02,168 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:00:02,168 INFO L139 ounterexampleChecker]: Examining path program with hash -921411347, occurence #1 [2025-04-14 15:00:02,168 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:00:02,168 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:00:02,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:00:02,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2029124123, now seen corresponding path program 1 times [2025-04-14 15:00:02,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:00:02,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798398843] [2025-04-14 15:00:02,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:00:02,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:00:02,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-14 15:00:02,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-14 15:00:02,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:00:02,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:00:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 15:00:03,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:00:03,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798398843] [2025-04-14 15:00:03,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798398843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:00:03,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:00:03,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 15:00:03,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893640127] [2025-04-14 15:00:03,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:00:03,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 15:00:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:00:03,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 15:00:03,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 15:00:03,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:00:03,564 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:00:03,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) [2025-04-14 15:00:03,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:03,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:03,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:03,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:00:03,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:03,564 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:00:07,585 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:11,589 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:15,598 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:16,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:16,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:16,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:16,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:00:16,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:16,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:16,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 15:00:16,991 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:00:16,991 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:00:16,991 INFO L139 ounterexampleChecker]: Examining path program with hash 1912037984, occurence #1 [2025-04-14 15:00:16,991 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:00:16,991 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:00:16,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:00:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash -803153823, now seen corresponding path program 1 times [2025-04-14 15:00:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:00:16,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500203196] [2025-04-14 15:00:16,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:00:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:00:17,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-14 15:00:18,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 15:00:18,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:00:18,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:00:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 15:00:18,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:00:18,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500203196] [2025-04-14 15:00:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500203196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:00:18,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:00:18,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 15:00:18,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538135605] [2025-04-14 15:00:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:00:18,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 15:00:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:00:18,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 15:00:18,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 15:00:18,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:00:18,955 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:00:18,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 15:00:18,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:18,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:18,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:18,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:00:18,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:18,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:18,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:00:22,975 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:26,979 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:30,987 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:31,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:31,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:31,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:31,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:00:31,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:31,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:31,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:31,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 15:00:31,766 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:00:31,766 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:00:31,766 INFO L139 ounterexampleChecker]: Examining path program with hash -1930717031, occurence #1 [2025-04-14 15:00:31,767 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:00:31,767 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:00:31,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:00:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 225103220, now seen corresponding path program 1 times [2025-04-14 15:00:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:00:31,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755555803] [2025-04-14 15:00:31,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:00:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:00:32,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 15:00:32,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 15:00:32,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:00:32,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:00:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 15:00:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:00:32,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755555803] [2025-04-14 15:00:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755555803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:00:32,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:00:32,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 15:00:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939079972] [2025-04-14 15:00:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:00:32,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:00:32,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:00:32,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:00:32,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:00:32,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:00:32,513 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:00:32,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2025-04-14 15:00:32,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:32,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:32,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:32,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:00:32,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:32,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:32,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:32,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:00:36,534 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:40,540 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:41,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:41,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:41,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:41,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:00:41,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:41,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:41,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:41,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:41,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 15:00:41,725 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:00:41,725 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:00:41,725 INFO L139 ounterexampleChecker]: Examining path program with hash 824082712, occurence #1 [2025-04-14 15:00:41,725 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:00:41,725 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:00:41,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:00:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1560953367, now seen corresponding path program 1 times [2025-04-14 15:00:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:00:41,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189911744] [2025-04-14 15:00:41,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:00:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:00:42,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-14 15:00:42,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-14 15:00:42,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:00:42,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:00:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 15:00:42,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:00:42,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189911744] [2025-04-14 15:00:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189911744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:00:42,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079914860] [2025-04-14 15:00:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:00:42,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:00:42,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:00:42,499 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) [2025-04-14 15:00:42,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 15:00:43,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-14 15:00:44,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-14 15:00:44,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:00:44,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:00:44,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-04-14 15:00:44,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:00:44,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 15:00:44,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 15:00:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 15:00:44,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:00:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 15:00:44,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079914860] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:00:44,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:00:44,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-04-14 15:00:44,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320895746] [2025-04-14 15:00:44,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:00:44,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 15:00:44,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:00:44,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 15:00:44,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-14 15:00:44,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:00:44,632 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:00:44,632 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 15:00:44,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:44,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:44,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:44,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:00:44,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:44,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:44,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:00:44,632 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:00:44,633 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:00:48,656 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:52,661 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:00:56,665 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:01:00,671 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:01:04,675 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:01:08,680 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:01:12,686 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:01:13,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:01:13,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:13,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:13,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:01:13,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:13,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:13,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:13,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:01:13,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 15:01:13,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 15:01:14,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:01:14,073 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:01:14,073 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:01:14,073 INFO L139 ounterexampleChecker]: Examining path program with hash -964193295, occurence #1 [2025-04-14 15:01:14,073 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:01:14,073 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:01:14,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:01:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1722524209, now seen corresponding path program 1 times [2025-04-14 15:01:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:01:14,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091543919] [2025-04-14 15:01:14,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:01:14,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:01:14,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-14 15:01:15,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-14 15:01:15,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:01:15,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:01:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-14 15:01:16,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:01:16,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091543919] [2025-04-14 15:01:16,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091543919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:01:16,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:01:16,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 15:01:16,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953032014] [2025-04-14 15:01:16,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:01:16,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:01:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:01:16,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:01:16,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:01:16,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:01:16,395 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:01:16,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 15:01:16,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:01:20,418 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 15:01:24,429 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-14 15:04:58,234 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 15:04:58,235 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 15:04:58,325 WARN L228 SmtUtils]: Removed 2 from assertion stack [2025-04-14 15:04:58,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 15:04:58,326 WARN L610 AbstractCegarLoop]: Verification canceled: while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 4ms.. [2025-04-14 15:04:58,328 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 15:04:58,332 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 15:04:58,334 INFO L320 ceAbstractionStarter]: Result for error location ldv_random_allocationless_scenario_3Thread1of1ForFork1 was TIMEOUT (1/3) [2025-04-14 15:04:58,335 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 15:04:58,335 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 15:04:58,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 15:04:58,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 03:04:58 BasicIcfg [2025-04-14 15:04:58,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 15:04:58,383 INFO L158 Benchmark]: Toolchain (without parser) took 838845.71ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 88.3MB in the beginning and 833.6MB in the end (delta: -745.2MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-14 15:04:58,383 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 15:04:58,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2097.61ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 30.4MB in the end (delta: 57.9MB). Peak memory consumption was 92.1MB. Max. memory is 8.0GB. [2025-04-14 15:04:58,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 324.85ms. Allocated memory is still 142.6MB. Free memory was 30.4MB in the beginning and 53.9MB in the end (delta: -23.5MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. [2025-04-14 15:04:58,383 INFO L158 Benchmark]: Boogie Preprocessor took 302.82ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 53.9MB in the beginning and 282.5MB in the end (delta: -228.6MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2025-04-14 15:04:58,384 INFO L158 Benchmark]: IcfgBuilder took 9634.60ms. Allocated memory was 385.9MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 282.5MB in the beginning and 939.5MB in the end (delta: -657.0MB). Peak memory consumption was 617.6MB. Max. memory is 8.0GB. [2025-04-14 15:04:58,384 INFO L158 Benchmark]: TraceAbstraction took 826476.75ms. Allocated memory was 1.6GB in the beginning and 1.4GB in the end (delta: -201.3MB). Free memory was 939.5MB in the beginning and 833.6MB in the end (delta: 105.9MB). Peak memory consumption was 724.0MB. Max. memory is 8.0GB. [2025-04-14 15:04:58,384 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2097.61ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 30.4MB in the end (delta: 57.9MB). Peak memory consumption was 92.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 324.85ms. Allocated memory is still 142.6MB. Free memory was 30.4MB in the beginning and 53.9MB in the end (delta: -23.5MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 302.82ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 53.9MB in the beginning and 282.5MB in the end (delta: -228.6MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. * IcfgBuilder took 9634.60ms. Allocated memory was 385.9MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 282.5MB in the beginning and 939.5MB in the end (delta: -657.0MB). Peak memory consumption was 617.6MB. Max. memory is 8.0GB. * TraceAbstraction took 826476.75ms. Allocated memory was 1.6GB in the beginning and 1.4GB in the end (delta: -201.3MB). Free memory was 939.5MB in the beginning and 833.6MB in the end (delta: 105.9MB). Peak memory consumption was 724.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 5646]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5646] - GenericResultAtLocation [Line: 5653]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5653] - GenericResultAtLocation [Line: 5660]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("":); [5660] - GenericResultAtLocation [Line: 5694]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/alpha/git/klever2/klever/native-scheduler-work-dir/scheduler/jobs/d5cd53f56669d61faa91054857893dbd/klever-core-work-dir/lkbce/arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [5694-5695] - GenericResultAtLocation [Line: 5700]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [5700-5702] - GenericResultAtLocation [Line: 5759]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [5759] - GenericResultAtLocation [Line: 5767]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [5767] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 202381, independent: 187795, independent conditional: 115817, independent unconditional: 71978, dependent: 14581, dependent conditional: 14399, dependent unconditional: 182, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188817, independent: 187795, independent conditional: 115817, independent unconditional: 71978, dependent: 1017, dependent conditional: 835, dependent unconditional: 182, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188817, independent: 187795, independent conditional: 115817, independent unconditional: 71978, dependent: 1017, dependent conditional: 835, dependent unconditional: 182, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191058, independent: 187795, independent conditional: 115817, independent unconditional: 71978, dependent: 3258, dependent conditional: 3076, dependent unconditional: 182, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191058, independent: 187795, independent conditional: 1, independent unconditional: 187794, dependent: 3258, dependent conditional: 360, dependent unconditional: 2898, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191058, independent: 187795, independent conditional: 1, independent unconditional: 187794, dependent: 3258, dependent conditional: 360, dependent unconditional: 2898, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67128, independent: 66842, independent conditional: 1, independent unconditional: 66841, dependent: 281, dependent conditional: 90, dependent unconditional: 191, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67129, independent: 66803, independent conditional: 0, independent unconditional: 66803, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 325, independent: 39, independent conditional: 1, independent unconditional: 38, dependent: 281, dependent conditional: 90, dependent unconditional: 191, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 325, independent: 39, independent conditional: 1, independent unconditional: 38, dependent: 281, dependent conditional: 90, dependent unconditional: 191, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 665994, independent: 14785, independent conditional: 517, independent unconditional: 14268, dependent: 260274, dependent conditional: 77402, dependent unconditional: 182872, unknown: 390935, unknown conditional: 0, unknown unconditional: 390935] , Symbolic Condition Computations: 2, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 191058, independent: 120953, independent conditional: 0, independent unconditional: 120953, dependent: 2977, dependent conditional: 270, dependent unconditional: 2707, unknown: 67128, unknown conditional: 91, unknown unconditional: 67037] , Statistics on independence cache: Total cache size (in pairs): 67130, Positive cache size: 66844, Positive conditional cache size: 3, Positive unconditional cache size: 66841, Negative cache size: 281, Negative conditional cache size: 90, Negative unconditional cache size: 191, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 118532, Maximal queried relation: 5, Independence queries for same thread: 13564, Persistent sets #1 benchmarks: Persistent set computation time: 576.0s, Number of persistent set computation: 1482, Number of trivial persistent sets: 2, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72165, independent: 71978, independent conditional: 0, independent unconditional: 71978, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 202381, independent: 187795, independent conditional: 115817, independent unconditional: 71978, dependent: 14581, dependent conditional: 14399, dependent unconditional: 182, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188817, independent: 187795, independent conditional: 115817, independent unconditional: 71978, dependent: 1017, dependent conditional: 835, dependent unconditional: 182, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188817, independent: 187795, independent conditional: 115817, independent unconditional: 71978, dependent: 1017, dependent conditional: 835, dependent unconditional: 182, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191058, independent: 187795, independent conditional: 115817, independent unconditional: 71978, dependent: 3258, dependent conditional: 3076, dependent unconditional: 182, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191058, independent: 187795, independent conditional: 1, independent unconditional: 187794, dependent: 3258, dependent conditional: 360, dependent unconditional: 2898, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191058, independent: 187795, independent conditional: 1, independent unconditional: 187794, dependent: 3258, dependent conditional: 360, dependent unconditional: 2898, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67128, independent: 66842, independent conditional: 1, independent unconditional: 66841, dependent: 281, dependent conditional: 90, dependent unconditional: 191, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67129, independent: 66803, independent conditional: 0, independent unconditional: 66803, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 325, independent: 39, independent conditional: 1, independent unconditional: 38, dependent: 281, dependent conditional: 90, dependent unconditional: 191, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 325, independent: 39, independent conditional: 1, independent unconditional: 38, dependent: 281, dependent conditional: 90, dependent unconditional: 191, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 665994, independent: 14785, independent conditional: 517, independent unconditional: 14268, dependent: 260274, dependent conditional: 77402, dependent unconditional: 182872, unknown: 390935, unknown conditional: 0, unknown unconditional: 390935] , Symbolic Condition Computations: 2, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 191058, independent: 120953, independent conditional: 0, independent unconditional: 120953, dependent: 2977, dependent conditional: 270, dependent unconditional: 2707, unknown: 67128, unknown conditional: 91, unknown unconditional: 67037] , Statistics on independence cache: Total cache size (in pairs): 67130, Positive cache size: 66844, Positive conditional cache size: 3, Positive unconditional cache size: 66841, Negative cache size: 281, Negative conditional cache size: 90, Negative unconditional cache size: 191, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 118532, Maximal queried relation: 5, Independence queries for same thread: 13564 - TimeoutResultAtElement [Line: 8678]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 4ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ldv_random_allocationless_scenario_3Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 797 locations, 1214 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 825.2s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 807.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 735 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 840 ConstructedInterpolants, 0 QuantifiedInterpolants, 1029 SizeOfPredicates, 8 NumberOfNonLiveVariables, 5283 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 110/116 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, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 1188, ConditionCalculationTime [ms]: 53, ConditionCalculations: 23, QuantifiedConditions: 0, TraceChecks: 2, UnknownTraceChecks: 0, UnsatisfiedConditions: 2, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown