/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.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -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 11:31:40,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 11:31:40,793 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 11:31:40,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 11:31:40,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 11:31:40,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 11:31:40,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 11:31:40,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 11:31:40,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 11:31:40,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 11:31:40,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 11:31:40,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 11:31:40,822 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 11:31:40,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 11:31:40,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 11:31:40,822 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 11:31:40,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 11:31:40,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 11:31:40,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 11:31:40,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 11:31:40,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 11:31:40,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 11:31:40,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 11:31:40,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 11:31:40,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 11:31:40,825 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 11:31:40,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 11:31:41,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 11:31:41,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 11:31:41,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 11:31:41,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 11:31:41,049 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 11:31:41,050 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 11:31:42,367 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86942b00d/c5181b46fda34863ab2d81be00cf6307/FLAGfd85c4915 [2025-04-14 11:31:42,834 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 11:31:42,836 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 11:31:42,876 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86942b00d/c5181b46fda34863ab2d81be00cf6307/FLAGfd85c4915 [2025-04-14 11:31:43,367 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86942b00d/c5181b46fda34863ab2d81be00cf6307 [2025-04-14 11:31:43,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 11:31:43,370 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 11:31:43,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 11:31:43,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 11:31:43,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 11:31:43,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:31:43" (1/1) ... [2025-04-14 11:31:43,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563d8a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:43, skipping insertion in model container [2025-04-14 11:31:43,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:31:43" (1/1) ... [2025-04-14 11:31:43,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 11:31:44,762 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 11:31:44,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 11:31:44,987 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 11:31:45,116 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 11:31:45,118 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 11:31:45,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [5660] [2025-04-14 11:31:45,119 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 11:31:45,120 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 11:31:45,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [5759] [2025-04-14 11:31:45,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [5767] [2025-04-14 11:31:45,236 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 11:31:45,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 11:31:45,313 INFO L204 MainTranslator]: Completed translation [2025-04-14 11:31:45,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45 WrapperNode [2025-04-14 11:31:45,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 11:31:45,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 11:31:45,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 11:31:45,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 11:31:45,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,575 INFO L138 Inliner]: procedures = 328, calls = 1288, calls flagged for inlining = 514, calls inlined = 855, statements flattened = 7854 [2025-04-14 11:31:45,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 11:31:45,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 11:31:45,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 11:31:45,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 11:31:45,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 11:31:45,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 11:31:45,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 11:31:45,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 11:31:45,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (1/1) ... [2025-04-14 11:31:45,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 11:31:45,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 11:31:45,887 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 11:31:45,889 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 11:31:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-04-14 11:31:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_random_allocationless_scenario_3 [2025-04-14 11:31:45,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_random_allocationless_scenario_3 [2025-04-14 11:31:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_scenario_2 [2025-04-14 11:31:45,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_scenario_2 [2025-04-14 11:31:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_insmod_4 [2025-04-14 11:31:45,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_insmod_4 [2025-04-14 11:31:45,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 11:31:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-14 11:31:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 11:31:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-14 11:31:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 11:31:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 11:31:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 11:31:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 11:31:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 11:31:45,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 11:31:45,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-14 11:31:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 11:31:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 11:31:45,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 11:31:45,913 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 11:31:46,349 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 11:31:46,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 11:31:51,256 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 11:31:51,256 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 11:31:55,157 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 11:31:55,157 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 11:31:55,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:31:55 BoogieIcfgContainer [2025-04-14 11:31:55,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 11:31:55,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 11:31:55,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 11:31:55,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 11:31:55,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:31:43" (1/3) ... [2025-04-14 11:31:55,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310e2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:31:55, skipping insertion in model container [2025-04-14 11:31:55,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:31:45" (2/3) ... [2025-04-14 11:31:55,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310e2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:31:55, skipping insertion in model container [2025-04-14 11:31:55,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:31:55" (3/3) ... [2025-04-14 11:31:55,164 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.14--drivers--net--irda--w83977af_ir.ko.cil.i [2025-04-14 11:31:55,176 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 11:31:55,180 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 11:31:55,180 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 11:31:55,957 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2025-04-14 11:31:56,008 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 11:31:56,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 11:31:56,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 11:31:56,014 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 11:31:56,015 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 11:31:56,466 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 11:31:56,478 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ldv_random_allocationless_scenario_3Thread1of1ForFork2 ======== [2025-04-14 11:31:56,486 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;@1cbddd65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 11:31:56,486 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 11:40:19,449 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:40:19,449 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:40:19,450 INFO L139 ounterexampleChecker]: Examining path program with hash 1760298759, occurence #1 [2025-04-14 11:40:19,450 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:40:19,450 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:40:19,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:40:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1002508874, now seen corresponding path program 1 times [2025-04-14 11:40:19,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:40:19,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069718490] [2025-04-14 11:40:19,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:40:19,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:40:20,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 11:40:20,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 11:40:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:40:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:40:20,900 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 11:40:20,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:40:20,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069718490] [2025-04-14 11:40:20,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069718490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:40:20,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:40:20,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 11:40:20,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164637487] [2025-04-14 11:40:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:40:20,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 11:40:20,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:40:20,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 11:40:20,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 11:40:20,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:40:20,925 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:40:20,926 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 11:40:20,926 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:40:24,967 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 11:40:28,978 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 11:40:29,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:40:29,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 11:40:29,898 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:40:29,898 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:40:29,898 INFO L139 ounterexampleChecker]: Examining path program with hash -476444689, occurence #1 [2025-04-14 11:40:29,898 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:40:29,898 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:40:29,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:40:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 732696646, now seen corresponding path program 1 times [2025-04-14 11:40:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:40:29,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127574584] [2025-04-14 11:40:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:40:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:40:30,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 11:40:30,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 11:40:30,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:40:30,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:40:30,796 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 11:40:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:40:30,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127574584] [2025-04-14 11:40:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127574584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 11:40:30,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141960735] [2025-04-14 11:40:30,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:40:30,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 11:40:30,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 11:40:30,799 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 11:40:30,799 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 11:40:32,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 11:40:32,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 11:40:32,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:40:32,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:40:32,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 11:40:32,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 11:40:32,462 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 11:40:32,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 11:40:32,483 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 11:40:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141960735] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 11:40:32,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 11:40:32,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-14 11:40:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728183828] [2025-04-14 11:40:32,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 11:40:32,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 11:40:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:40:32,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 11:40:32,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 11:40:32,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:40:32,486 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:40:32,486 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 11:40:32,486 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:40:32,486 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:40:36,507 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 11:40:40,512 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 11:40:44,517 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 11:40:48,521 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 11:40:49,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:40:49,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:40:49,183 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 11:40:49,371 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 11:40:49,371 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:40:49,371 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:40:49,372 INFO L139 ounterexampleChecker]: Examining path program with hash -476444689, occurence #2 [2025-04-14 11:40:49,372 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 11:40:49,372 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 11:40:49,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:40:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 709250, now seen corresponding path program 1 times [2025-04-14 11:40:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 11:40:49,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060339992] [2025-04-14 11:40:49,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:40:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:40:49,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-14 11:40:50,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-14 11:40:50,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:40:50,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 11:40:50,080 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 11:40:50,081 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 11:40:50,081 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 11:40:50,081 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,081 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 11:40:50,081 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,081 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 11:40:50,081 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,081 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 11:40:50,081 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,081 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-14 11:40:50,082 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,082 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 11:40:50,082 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,082 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 38 [2025-04-14 11:40:50,082 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,082 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-04-14 11:40:50,082 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,082 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 41 [2025-04-14 11:40:50,082 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,082 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 11:40:50,082 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:40:50,082 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 11:40:50,082 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:40:50,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:40:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1524500406, now seen corresponding path program 2 times [2025-04-14 11:40:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:40:50,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043729320] [2025-04-14 11:40:50,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 11:40:50,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:40:50,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-04-14 11:40:50,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 53 statements. [2025-04-14 11:40:50,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 11:40:50,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:40:51,038 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 11:40:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:40:51,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043729320] [2025-04-14 11:40:51,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043729320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:40:51,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:40:51,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 11:40:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422402002] [2025-04-14 11:40:51,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:40:51,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 11:40:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:40:51,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 11:40:51,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 11:40:51,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:40:51,039 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:40:51,040 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 11:40:51,040 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:40:51,040 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:40:51,040 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:40:55,064 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 11:40:59,067 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 11:41:03,072 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 11:41:04,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:41:04,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:04,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:04,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2025-04-14 11:41:04,706 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:41:04,706 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:41:04,706 INFO L139 ounterexampleChecker]: Examining path program with hash 1061132115, occurence #1 [2025-04-14 11:41:04,707 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:41:04,707 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:41:04,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:41:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash -413602292, now seen corresponding path program 1 times [2025-04-14 11:41:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:41:04,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292042693] [2025-04-14 11:41:04,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:41:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:41:05,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-14 11:41:05,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-14 11:41:05,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:41:05,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:41:05,574 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 11:41:05,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:41:05,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292042693] [2025-04-14 11:41:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292042693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:41:05,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:41:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 11:41:05,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422786617] [2025-04-14 11:41:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:41:05,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 11:41:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:41:05,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 11:41:05,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 11:41:05,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:41:05,575 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:41:05,575 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 11:41:05,575 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:41:05,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:05,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:05,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:41:09,601 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 11:41:13,610 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 11:41:17,616 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 11:41:18,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:41:18,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:18,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:18,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 11:41:18,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 11:41:18,207 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:41:18,207 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:41:18,207 INFO L139 ounterexampleChecker]: Examining path program with hash 1061132115, occurence #2 [2025-04-14 11:41:18,207 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 11:41:18,207 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 11:41:18,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:41:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash 709261, now seen corresponding path program 1 times [2025-04-14 11:41:18,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 11:41:18,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001853558] [2025-04-14 11:41:18,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:41:18,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:41:18,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-14 11:41:18,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-14 11:41:18,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:41:18,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 11:41:18,841 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 11:41:18,841 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 38 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 41 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 11:41:18,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 11:41:18,842 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 11:41:18,842 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:41:18,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:41:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1235612934, now seen corresponding path program 1 times [2025-04-14 11:41:18,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:41:18,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040637868] [2025-04-14 11:41:18,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:41:18,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:41:19,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-14 11:41:19,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-14 11:41:19,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:41:19,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:41:20,394 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 11:41:20,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:41:20,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040637868] [2025-04-14 11:41:20,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040637868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:41:20,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:41:20,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 11:41:20,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472096485] [2025-04-14 11:41:20,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:41:20,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 11:41:20,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:41:20,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 11:41:20,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 11:41:20,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:41:20,396 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:41:20,396 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 11:41:20,396 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:41:20,396 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:20,396 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:20,396 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 11:41:20,396 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:41:24,417 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 11:41:28,423 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 11:41:32,435 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 11:41:33,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:41:33,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:33,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:33,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 11:41:33,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:33,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2025-04-14 11:41:33,704 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:41:33,704 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:41:33,704 INFO L139 ounterexampleChecker]: Examining path program with hash -565603263, occurence #1 [2025-04-14 11:41:33,704 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:41:33,704 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:41:33,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:41:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash 540322150, now seen corresponding path program 1 times [2025-04-14 11:41:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:41:33,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504134223] [2025-04-14 11:41:33,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:41:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:41:34,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-14 11:41:34,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-14 11:41:34,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:41:34,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:41:35,165 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 11:41:35,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:41:35,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504134223] [2025-04-14 11:41:35,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504134223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:41:35,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:41:35,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 11:41:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004876388] [2025-04-14 11:41:35,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:41:35,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 11:41:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:41:35,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 11:41:35,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 11:41:35,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:41:35,166 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:41:35,166 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 11:41:35,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:41:35,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:35,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:35,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 11:41:35,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:35,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:41:39,187 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 11:41:43,192 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 11:41:47,195 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 11:41:48,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:41:48,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:48,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:48,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 11:41:48,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:48,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:48,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 11:41:48,616 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:41:48,616 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:41:48,616 INFO L139 ounterexampleChecker]: Examining path program with hash -127452381, occurence #1 [2025-04-14 11:41:48,616 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:41:48,616 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:41:48,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:41:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash 487144611, now seen corresponding path program 1 times [2025-04-14 11:41:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:41:48,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899021948] [2025-04-14 11:41:48,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:41:48,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:41:49,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-14 11:41:50,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 11:41:50,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:41:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:41:50,675 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 11:41:50,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:41:50,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899021948] [2025-04-14 11:41:50,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899021948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:41:50,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:41:50,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 11:41:50,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205057000] [2025-04-14 11:41:50,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:41:50,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 11:41:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:41:50,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 11:41:50,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 11:41:50,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:41:50,677 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:41:50,677 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 11:41:50,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:41:50,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:50,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:50,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 11:41:50,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:50,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:41:50,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:41:54,700 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 11:41:58,710 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 11:42:02,713 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 11:42:11,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:42:11,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:11,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:11,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 11:42:11,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:11,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:11,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:11,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 11:42:11,084 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 11:42:11,084 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 11:42:11,084 INFO L139 ounterexampleChecker]: Examining path program with hash 1201139140, occurence #1 [2025-04-14 11:42:11,084 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 11:42:11,084 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 11:42:11,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 11:42:11,085 INFO L85 PathProgramCache]: Analyzing trace with hash 79745573, now seen corresponding path program 1 times [2025-04-14 11:42:11,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 11:42:11,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402989488] [2025-04-14 11:42:11,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 11:42:11,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 11:42:11,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 11:42:12,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 11:42:12,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 11:42:12,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 11:42:13,337 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 11:42:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 11:42:13,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402989488] [2025-04-14 11:42:13,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402989488] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 11:42:13,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 11:42:13,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 11:42:13,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792042357] [2025-04-14 11:42:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 11:42:13,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 11:42:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 11:42:13,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 11:42:13,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 11:42:13,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:42:13,339 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 11:42:13,339 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 11:42:13,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 11:42:13,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:13,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:13,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 11:42:13,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:13,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:13,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 11:42:13,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 11:42:17,361 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 11:42:21,369 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 11:45:49,789 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 11:45:49,791 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 11:45:49,992 WARN L228 SmtUtils]: Removed 2 from assertion stack [2025-04-14 11:45:49,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 11:45:49,992 WARN L610 AbstractCegarLoop]: Verification canceled: while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 2ms.. [2025-04-14 11:45:49,993 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ldv_random_allocationless_scenario_3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 11:45:49,997 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-04-14 11:45:49,998 INFO L320 ceAbstractionStarter]: Result for error location ldv_random_allocationless_scenario_3Thread1of1ForFork2 was TIMEOUT (1/3) [2025-04-14 11:45:49,999 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 11:45:50,000 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 11:45:50,028 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 11:45:50,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:45:50 BasicIcfg [2025-04-14 11:45:50,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 11:45:50,029 INFO L158 Benchmark]: Toolchain (without parser) took 846659.00ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 88.3MB in the beginning and 404.0MB in the end (delta: -315.7MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-14 11:45:50,029 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 11:45:50,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1942.44ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 29.5MB in the end (delta: 58.8MB). Peak memory consumption was 91.9MB. Max. memory is 8.0GB. [2025-04-14 11:45:50,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 261.00ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 29.5MB in the beginning and 280.4MB in the end (delta: -250.9MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2025-04-14 11:45:50,030 INFO L158 Benchmark]: Boogie Preprocessor took 283.76ms. Allocated memory is still 369.1MB. Free memory was 280.4MB in the beginning and 245.4MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 11:45:50,030 INFO L158 Benchmark]: RCFGBuilder took 9297.61ms. Allocated memory was 369.1MB in the beginning and 1.2GB in the end (delta: 784.3MB). Free memory was 245.4MB in the beginning and 478.2MB in the end (delta: -232.8MB). Peak memory consumption was 848.3MB. Max. memory is 8.0GB. [2025-04-14 11:45:50,030 INFO L158 Benchmark]: TraceAbstraction took 834870.09ms. Allocated memory was 1.2GB in the beginning and 1.5GB in the end (delta: 394.3MB). Free memory was 478.2MB in the beginning and 404.0MB in the end (delta: 74.2MB). Peak memory consumption was 664.3MB. Max. memory is 8.0GB. [2025-04-14 11:45:50,030 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.17ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1942.44ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 29.5MB in the end (delta: 58.8MB). Peak memory consumption was 91.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 261.00ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 29.5MB in the beginning and 280.4MB in the end (delta: -250.9MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 283.76ms. Allocated memory is still 369.1MB. Free memory was 280.4MB in the beginning and 245.4MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * RCFGBuilder took 9297.61ms. Allocated memory was 369.1MB in the beginning and 1.2GB in the end (delta: 784.3MB). Free memory was 245.4MB in the beginning and 478.2MB in the end (delta: -232.8MB). Peak memory consumption was 848.3MB. Max. memory is 8.0GB. * TraceAbstraction took 834870.09ms. Allocated memory was 1.2GB in the beginning and 1.5GB in the end (delta: 394.3MB). Free memory was 478.2MB in the beginning and 404.0MB in the end (delta: 74.2MB). Peak memory consumption was 664.3MB. 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: 108121, independent: 103645, independent conditional: 33403, independent unconditional: 70242, dependent: 4470, dependent conditional: 4282, dependent unconditional: 188, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104048, independent: 103645, independent conditional: 33403, independent unconditional: 70242, dependent: 397, dependent conditional: 209, dependent unconditional: 188, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104048, independent: 103645, independent conditional: 33403, independent unconditional: 70242, dependent: 397, dependent conditional: 209, dependent unconditional: 188, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104359, independent: 103645, independent conditional: 33403, independent unconditional: 70242, dependent: 708, dependent conditional: 520, dependent unconditional: 188, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104359, independent: 103645, independent conditional: 1, independent unconditional: 103644, dependent: 708, dependent conditional: 0, dependent unconditional: 708, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104359, independent: 103645, independent conditional: 1, independent unconditional: 103644, dependent: 708, dependent conditional: 0, dependent unconditional: 708, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67487, independent: 67284, independent conditional: 1, independent unconditional: 67283, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67488, independent: 67240, independent conditional: 0, independent unconditional: 67240, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 247, independent: 44, independent conditional: 1, independent unconditional: 43, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 247, independent: 44, independent conditional: 1, independent unconditional: 43, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 712235, independent: 15411, independent conditional: 394, independent unconditional: 15017, dependent: 196919, dependent conditional: 0, dependent unconditional: 196919, unknown: 499905, unknown conditional: 0, unknown unconditional: 499905] , Symbolic Condition Computations: 2, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 104359, independent: 36361, independent conditional: 0, independent unconditional: 36361, dependent: 511, dependent conditional: 0, dependent unconditional: 511, unknown: 67487, unknown conditional: 1, unknown unconditional: 67486] , Statistics on independence cache: Total cache size (in pairs): 67489, Positive cache size: 67286, Positive conditional cache size: 3, Positive unconditional cache size: 67283, Negative cache size: 197, Negative conditional cache size: 0, Negative unconditional cache size: 197, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6, Eliminated conditions: 33922, Maximal queried relation: 3, Independence queries for same thread: 4073, Persistent sets #1 benchmarks: Persistent set computation time: 698.7s, Number of persistent set computation: 1493, Number of trivial persistent sets: 2, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70436, independent: 70242, independent conditional: 0, independent unconditional: 70242, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 108121, independent: 103645, independent conditional: 33403, independent unconditional: 70242, dependent: 4470, dependent conditional: 4282, dependent unconditional: 188, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104048, independent: 103645, independent conditional: 33403, independent unconditional: 70242, dependent: 397, dependent conditional: 209, dependent unconditional: 188, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104048, independent: 103645, independent conditional: 33403, independent unconditional: 70242, dependent: 397, dependent conditional: 209, dependent unconditional: 188, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104359, independent: 103645, independent conditional: 33403, independent unconditional: 70242, dependent: 708, dependent conditional: 520, dependent unconditional: 188, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104359, independent: 103645, independent conditional: 1, independent unconditional: 103644, dependent: 708, dependent conditional: 0, dependent unconditional: 708, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104359, independent: 103645, independent conditional: 1, independent unconditional: 103644, dependent: 708, dependent conditional: 0, dependent unconditional: 708, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67487, independent: 67284, independent conditional: 1, independent unconditional: 67283, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67488, independent: 67240, independent conditional: 0, independent unconditional: 67240, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 247, independent: 44, independent conditional: 1, independent unconditional: 43, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 247, independent: 44, independent conditional: 1, independent unconditional: 43, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 712235, independent: 15411, independent conditional: 394, independent unconditional: 15017, dependent: 196919, dependent conditional: 0, dependent unconditional: 196919, unknown: 499905, unknown conditional: 0, unknown unconditional: 499905] , Symbolic Condition Computations: 2, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 104359, independent: 36361, independent conditional: 0, independent unconditional: 36361, dependent: 511, dependent conditional: 0, dependent unconditional: 511, unknown: 67487, unknown conditional: 1, unknown unconditional: 67486] , Statistics on independence cache: Total cache size (in pairs): 67489, Positive cache size: 67286, Positive conditional cache size: 3, Positive unconditional cache size: 67283, Negative cache size: 197, Negative conditional cache size: 0, Negative unconditional cache size: 197, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6, Eliminated conditions: 33922, Maximal queried relation: 3, Independence queries for same thread: 4073 - 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 2ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ldv_random_allocationless_scenario_3Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 797 locations, 1214 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 833.6s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 818.7s, 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: 32, 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.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 494 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 532 ConstructedInterpolants, 0 QuantifiedInterpolants, 617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2579 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 34/37 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]: 1343, ConditionCalculationTime [ms]: 60, ConditionCalculations: 23, QuantifiedConditions: 0, TraceChecks: 2, UnknownTraceChecks: 0, UnsatisfiedConditions: 2, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown