./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 00:20:29,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 00:20:29,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 00:20:29,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 00:20:29,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 00:20:29,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 00:20:29,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 00:20:29,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 00:20:29,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 00:20:29,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 00:20:29,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 00:20:29,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 00:20:29,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 00:20:29,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 00:20:29,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:20:29,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:20:29,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 00:20:29,580 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 00:20:29,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 00:20:29,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 00:20:29,581 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 00:20:29,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 00:20:29,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 00:20:29,581 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 00:20:29,581 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 00:20:29,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> SLEEP_NEW_STATES [2025-04-25 00:20:29,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 00:20:29,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 00:20:29,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 00:20:29,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 00:20:29,809 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 00:20:29,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-04-25 00:20:31,100 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/545484254/677bf5d23e12462592efd52a312827d7/FLAGa6e5be2d3 [2025-04-25 00:20:31,567 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 00:20:31,567 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-04-25 00:20:31,607 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/545484254/677bf5d23e12462592efd52a312827d7/FLAGa6e5be2d3 [2025-04-25 00:20:32,100 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/545484254/677bf5d23e12462592efd52a312827d7 [2025-04-25 00:20:32,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 00:20:32,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 00:20:32,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 00:20:32,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 00:20:32,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 00:20:32,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 12:20:32" (1/1) ... [2025-04-25 00:20:32,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e9c974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:32, skipping insertion in model container [2025-04-25 00:20:32,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 12:20:32" (1/1) ... [2025-04-25 00:20:32,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 00:20:32,467 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-04-25 00:20:36,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 00:20:36,147 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 00:20:36,167 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-04-25 00:20:36,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-04-25 00:20:36,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-04-25 00:20:36,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-04-25 00:20:36,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-04-25 00:20:36,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-04-25 00:20:36,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 00:20:36,661 INFO L204 MainTranslator]: Completed translation [2025-04-25 00:20:36,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36 WrapperNode [2025-04-25 00:20:36,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 00:20:36,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 00:20:36,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 00:20:36,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 00:20:36,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,773 INFO L138 Inliner]: procedures = 1352, calls = 1469, calls flagged for inlining = 352, calls inlined = 18, statements flattened = 394 [2025-04-25 00:20:36,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 00:20:36,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 00:20:36,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 00:20:36,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 00:20:36,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 00:20:36,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 00:20:36,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 00:20:36,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 00:20:36,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (1/1) ... [2025-04-25 00:20:36,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:20:36,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:20:36,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 00:20:36,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 00:20:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-25 00:20:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-25 00:20:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 00:20:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 00:20:36,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 00:20:36,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-25 00:20:36,877 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-04-25 00:20:36,877 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-04-25 00:20:36,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-25 00:20:36,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-25 00:20:36,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-25 00:20:36,877 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-04-25 00:20:36,878 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-04-25 00:20:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 00:20:36,879 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 00:20:37,181 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 00:20:37,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 00:20:37,561 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 00:20:37,561 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 00:20:37,989 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 00:20:37,990 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 00:20:37,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:20:37 BoogieIcfgContainer [2025-04-25 00:20:37,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 00:20:37,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 00:20:37,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 00:20:37,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 00:20:37,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 12:20:32" (1/3) ... [2025-04-25 00:20:37,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8fa0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:20:37, skipping insertion in model container [2025-04-25 00:20:37,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:20:36" (2/3) ... [2025-04-25 00:20:37,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8fa0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:20:37, skipping insertion in model container [2025-04-25 00:20:37,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:20:37" (3/3) ... [2025-04-25 00:20:37,999 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram.i [2025-04-25 00:20:38,010 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 00:20:38,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_write_nvram.i that has 3 procedures, 43 locations, 50 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-25 00:20:38,015 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 00:20:38,086 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 00:20:38,117 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:20:38,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 00:20:38,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:20:38,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 00:20:38,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 00:20:38,326 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 00:20:38,332 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 00:20:38,340 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;@7986529d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:20:38,340 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 00:20:38,363 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 00:20:38,363 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-25 00:20:38,366 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-25 00:20:38,367 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (1/3) [2025-04-25 00:20:38,371 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:20:38,375 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 00:20:38,375 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == whoop_wrapper_write_nvramThread1of1ForFork1 ======== [2025-04-25 00:20:38,375 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;@7986529d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:20:38,375 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 00:20:38,391 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:20:38,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:20:38,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2039993743, now seen corresponding path program 1 times [2025-04-25 00:20:38,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:20:38,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33191800] [2025-04-25 00:20:38,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:20:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:20:38,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 00:20:38,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 00:20:38,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:20:38,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:20:40,346 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-25 00:20:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:20:40,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33191800] [2025-04-25 00:20:40,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33191800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:20:40,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:20:40,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-25 00:20:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585587587] [2025-04-25 00:20:40,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:20:40,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 00:20:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:20:40,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 00:20:40,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-25 00:20:40,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:20:40,369 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:20:40,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-25 00:20:40,370 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:20:40,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 00:20:40,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 00:20:40,861 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:20:40,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:20:40,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1161423089, now seen corresponding path program 1 times [2025-04-25 00:20:40,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:20:40,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139572767] [2025-04-25 00:20:40,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:20:40,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:20:40,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 00:20:40,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 00:20:40,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:20:40,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:20:43,187 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-25 00:20:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:20:43,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139572767] [2025-04-25 00:20:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139572767] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:20:43,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:20:43,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-25 00:20:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210878409] [2025-04-25 00:20:43,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:20:43,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-25 00:20:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:20:43,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-25 00:20:43,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-25 00:20:43,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:20:43,190 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:20:43,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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-25 00:20:43,190 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 00:20:43,190 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:20:44,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 00:20:44,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-25 00:20:44,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 00:20:44,118 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:20:44,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:20:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1298928627, now seen corresponding path program 1 times [2025-04-25 00:20:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:20:44,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377347559] [2025-04-25 00:20:44,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:20:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:20:44,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-25 00:20:44,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 00:20:44,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:20:44,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:20:45,888 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-25 00:20:45,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:20:45,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377347559] [2025-04-25 00:20:45,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377347559] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:20:45,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:20:45,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-25 00:20:45,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889794229] [2025-04-25 00:20:45,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:20:45,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-25 00:20:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:20:45,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-25 00:20:45,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-25 00:20:45,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:20:45,890 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:20:45,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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-25 00:20:45,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 00:20:45,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-25 00:20:45,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:20:49,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:20:49,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:20:49,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:20:49,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 00:20:49,230 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:20:49,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:20:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash -220306669, now seen corresponding path program 1 times [2025-04-25 00:20:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:20:49,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415386642] [2025-04-25 00:20:49,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:20:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:20:49,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-25 00:20:49,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 00:20:49,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:20:49,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:20:50,834 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-25 00:20:50,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:20:50,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415386642] [2025-04-25 00:20:50,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415386642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:20:50,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:20:50,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-25 00:20:50,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220140425] [2025-04-25 00:20:50,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:20:50,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 00:20:50,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:20:50,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 00:20:50,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-25 00:20:50,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:20:50,835 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:20:50,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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-25 00:20:50,835 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:20:50,835 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:20:50,835 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:20:50,835 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:20:51,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:20:51,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:20:51,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:20:51,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:20:51,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 00:20:51,722 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:20:51,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:20:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2100382762, now seen corresponding path program 1 times [2025-04-25 00:20:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:20:51,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055881880] [2025-04-25 00:20:51,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:20:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:20:51,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-25 00:20:51,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 00:20:51,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:20:51,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:20:55,966 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-25 00:20:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:20:55,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055881880] [2025-04-25 00:20:55,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055881880] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 00:20:55,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749842311] [2025-04-25 00:20:55,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:20:55,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:20:55,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:20:55,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 00:20:55,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 00:20:56,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-25 00:20:56,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 00:20:56,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:20:56,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:20:56,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-25 00:20:56,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 00:20:56,280 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-25 00:20:56,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2025-04-25 00:20:56,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-25 00:20:57,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 67 [2025-04-25 00:20:57,255 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-25 00:20:57,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 00:20:57,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-04-25 00:21:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 00:21:00,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749842311] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-25 00:21:00,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-25 00:21:00,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20, 13] total 40 [2025-04-25 00:21:00,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451046956] [2025-04-25 00:21:00,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:21:00,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-25 00:21:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:21:00,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-25 00:21:00,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1450, Unknown=0, NotChecked=0, Total=1560 [2025-04-25 00:21:00,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:00,352 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:21:00,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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-25 00:21:00,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:00,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:00,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:00,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:00,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:01,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:01,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:01,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:01,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:01,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-25 00:21:01,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-25 00:21:01,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:21:01,564 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:21:01,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:21:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2029631896, now seen corresponding path program 2 times [2025-04-25 00:21:01,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:21:01,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027670491] [2025-04-25 00:21:01,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 00:21:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:21:01,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-25 00:21:01,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 00:21:01,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 00:21:01,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:21:04,276 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-25 00:21:04,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:21:04,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027670491] [2025-04-25 00:21:04,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027670491] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 00:21:04,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945310295] [2025-04-25 00:21:04,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 00:21:04,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:21:04,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:21:04,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 00:21:04,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 00:21:04,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-25 00:21:04,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 00:21:04,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 00:21:04,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:21:04,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-25 00:21:04,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 00:21:04,808 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2025-04-25 00:21:05,071 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-25 00:21:05,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 00:21:05,590 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 00:21:05,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2025-04-25 00:21:05,692 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-25 00:21:05,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945310295] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 00:21:05,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 00:21:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 34 [2025-04-25 00:21:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118253853] [2025-04-25 00:21:05,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 00:21:05,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-25 00:21:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:21:05,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-25 00:21:05,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2025-04-25 00:21:05,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:05,694 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:21:05,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 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-25 00:21:05,694 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:05,695 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:05,695 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:05,695 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:05,695 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2025-04-25 00:21:05,695 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:10,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:10,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:10,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:10,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:10,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-25 00:21:10,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-25 00:21:10,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-25 00:21:10,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:21:10,605 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:21:10,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:21:10,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1373196744, now seen corresponding path program 1 times [2025-04-25 00:21:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:21:10,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067008852] [2025-04-25 00:21:10,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:21:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:21:10,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-25 00:21:10,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-25 00:21:10,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:21:10,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:21:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:21:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:21:13,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067008852] [2025-04-25 00:21:13,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067008852] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 00:21:13,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956934098] [2025-04-25 00:21:13,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:21:13,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:21:13,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:21:13,133 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 00:21:13,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 00:21:13,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-25 00:21:13,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-25 00:21:13,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:21:13,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:21:13,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-25 00:21:13,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 00:21:13,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-25 00:21:13,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2025-04-25 00:21:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:21:14,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 00:21:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:21:14,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956934098] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 00:21:14,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 00:21:14,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 36 [2025-04-25 00:21:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181504904] [2025-04-25 00:21:14,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 00:21:14,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-25 00:21:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:21:14,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-25 00:21:14,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2025-04-25 00:21:14,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:14,649 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:21:14,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.25) internal successors, (81), 36 states have internal predecessors, (81), 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-25 00:21:14,649 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:14,649 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:14,649 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:14,649 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:14,649 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2025-04-25 00:21:14,649 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-25 00:21:14,649 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:24,846 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-25 00:21:30,047 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-25 00:21:33,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:33,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:33,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:33,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:33,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-25 00:21:33,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-25 00:21:33,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-25 00:21:33,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-25 00:21:33,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:21:33,929 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:21:33,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:21:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash 449781683, now seen corresponding path program 2 times [2025-04-25 00:21:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:21:33,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983778243] [2025-04-25 00:21:33,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 00:21:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:21:33,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-25 00:21:33,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 00:21:33,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 00:21:33,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:21:35,397 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-25 00:21:35,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:21:35,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983778243] [2025-04-25 00:21:35,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983778243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:21:35,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:21:35,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-25 00:21:35,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817120231] [2025-04-25 00:21:35,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:21:35,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 00:21:35,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:21:35,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 00:21:35,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-04-25 00:21:35,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:35,399 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:21:35,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-25 00:21:35,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:35,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:35,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:35,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:35,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-25 00:21:35,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2025-04-25 00:21:35,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2025-04-25 00:21:35,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:38,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:38,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:38,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:38,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:38,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-25 00:21:38,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-25 00:21:38,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-25 00:21:38,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-25 00:21:38,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-25 00:21:38,050 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:21:38,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:21:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 437340372, now seen corresponding path program 1 times [2025-04-25 00:21:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:21:38,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477398023] [2025-04-25 00:21:38,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:21:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:21:38,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-25 00:21:38,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 00:21:38,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:21:38,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:21:40,273 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-25 00:21:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:21:40,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477398023] [2025-04-25 00:21:40,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477398023] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:21:40,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:21:40,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-25 00:21:40,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752728157] [2025-04-25 00:21:40,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:21:40,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-25 00:21:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:21:40,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-25 00:21:40,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-04-25 00:21:40,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:40,274 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:21:40,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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-25 00:21:40,274 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:40,274 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:40,274 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:40,274 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:40,275 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-25 00:21:40,275 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2025-04-25 00:21:40,275 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2025-04-25 00:21:40,275 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2025-04-25 00:21:40,275 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:21:42,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:42,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 00:21:42,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 00:21:42,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 00:21:42,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-25 00:21:42,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-25 00:21:42,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-25 00:21:42,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-25 00:21:42,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-25 00:21:42,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-25 00:21:42,368 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 00:21:42,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:21:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1240139542, now seen corresponding path program 3 times [2025-04-25 00:21:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:21:42,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773529217] [2025-04-25 00:21:42,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 00:21:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:21:42,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-25 00:21:42,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 00:21:42,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-25 00:21:42,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 00:21:42,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 00:21:42,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-25 00:21:42,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 00:21:42,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:21:42,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 00:21:42,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 00:21:42,536 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 00:21:42,536 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-25 00:21:42,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-25 00:21:42,537 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2025-04-25 00:21:42,537 INFO L320 ceAbstractionStarter]: Result for error location whoop_wrapper_write_nvramThread1of1ForFork1 was UNSAFE (2/3) [2025-04-25 00:21:42,701 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 00:21:42,701 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 00:21:42,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-25 00:21:42,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 12:21:42 BasicIcfg [2025-04-25 00:21:42,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 00:21:42,748 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-25 00:21:42,748 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-25 00:21:42,749 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-25 00:21:42,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:20:37" (3/4) ... [2025-04-25 00:21:42,754 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-25 00:21:42,915 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 38. [2025-04-25 00:21:42,981 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-25 00:21:42,981 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-25 00:21:42,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-25 00:21:42,982 INFO L158 Benchmark]: Toolchain (without parser) took 70878.76ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 111.7MB in the beginning and 205.5MB in the end (delta: -93.8MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. [2025-04-25 00:21:42,982 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 00:21:42,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4557.75ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 46.1MB in the end (delta: 65.7MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. [2025-04-25 00:21:42,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.56ms. Allocated memory is still 167.8MB. Free memory was 46.1MB in the beginning and 35.7MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-25 00:21:42,982 INFO L158 Benchmark]: Boogie Preprocessor took 54.37ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 35.7MB in the beginning and 374.0MB in the end (delta: -338.3MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2025-04-25 00:21:42,983 INFO L158 Benchmark]: RCFGBuilder took 1158.73ms. Allocated memory is still 444.6MB. Free memory was 374.0MB in the beginning and 185.6MB in the end (delta: 188.4MB). Peak memory consumption was 184.5MB. Max. memory is 16.1GB. [2025-04-25 00:21:42,983 INFO L158 Benchmark]: TraceAbstraction took 64754.00ms. Allocated memory was 444.6MB in the beginning and 285.2MB in the end (delta: -159.4MB). Free memory was 184.4MB in the beginning and 106.3MB in the end (delta: 78.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 00:21:42,983 INFO L158 Benchmark]: Witness Printer took 232.76ms. Allocated memory is still 285.2MB. Free memory was 106.3MB in the beginning and 205.5MB in the end (delta: -99.2MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2025-04-25 00:21:42,984 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.20ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4557.75ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 46.1MB in the end (delta: 65.7MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.56ms. Allocated memory is still 167.8MB. Free memory was 46.1MB in the beginning and 35.7MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.37ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 35.7MB in the beginning and 374.0MB in the end (delta: -338.3MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1158.73ms. Allocated memory is still 444.6MB. Free memory was 374.0MB in the beginning and 185.6MB in the end (delta: 188.4MB). Peak memory consumption was 184.5MB. Max. memory is 16.1GB. * TraceAbstraction took 64754.00ms. Allocated memory was 444.6MB in the beginning and 285.2MB in the end (delta: -159.4MB). Free memory was 184.4MB in the beginning and 106.3MB in the end (delta: 78.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 232.76ms. Allocated memory is still 285.2MB. Free memory was 106.3MB in the beginning and 205.5MB in the end (delta: -99.2MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 5817]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 51, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 39, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 35, unknown conditional: 0, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4459, independent: 3732, independent conditional: 3732, independent unconditional: 0, dependent: 711, dependent conditional: 711, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3800, independent: 3732, independent conditional: 0, independent unconditional: 3732, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 214, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 214, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2186, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 2123, unknown conditional: 0, unknown unconditional: 2123] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 3800, independent: 3525, independent conditional: 0, independent unconditional: 3525, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 228, unknown conditional: 0, unknown unconditional: 228] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 242, Positive conditional cache size: 0, Positive unconditional cache size: 242, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Independence queries for same thread: 659 - CounterExampleResult [Line: 175]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L247] 0 unsigned long jiffies; [L6522] 0 const unsigned int default_alloc_size = 4; [L6692] 0 static struct mutex nvram_mutex = { 1, 0 }; [L6693] 0 static ssize_t nvram_len; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6797-L6801] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; [L6820] 0 int (* _whoop_init)(void) = nvram_init; [L6821] 0 void (* _whoop_exit)(void) = nvram_cleanup; [L6822] 0 struct inode *whoop_inode_0; [L6823] 0 struct file *whoop_file_0; [L6824] 0 struct inode *whoop_inode_1; [L6825] 0 struct file *whoop_file_1; [L6826] 0 struct inode *whoop_inode_2; [L6827] 0 struct file *whoop_file_2; [L6828] 0 struct inode *whoop_inode_3; [L6829] 0 struct file *whoop_file_3; [L6830] 0 struct inode *whoop_inode_4; [L6831] 0 struct file *whoop_file_4; [L6832] 0 struct pci_dev *whoop_pci_dev; [L6833] 0 char *whoop_buf; [L6834] 0 struct platform_device *whoop_platform_device; [L6835] 0 struct vm_area_struct *whoop_vm_area_struct; [L6836] 0 struct cx_dev *whoop_cx_dev; [L6837] 0 poll_table *whoop_poll_table; [L6838] 0 loff_t *whoop_loff_t; [L6839] 0 int whoop_int; [L6867] 0 whoop_inode_0 = (struct inode *) malloc(sizeof(struct inode)) [L6868] 0 whoop_file_0 = (struct file *) malloc(sizeof(struct file)) [L6869] 0 whoop_inode_1 = (struct inode *) malloc(sizeof(struct inode)) [L6870] 0 whoop_file_1 = (struct file *) malloc(sizeof(struct file)) [L6871] 0 whoop_inode_2 = (struct inode *) malloc(sizeof(struct inode)) [L6872] 0 whoop_file_2 = (struct file *) malloc(sizeof(struct file)) [L6873] 0 whoop_inode_3 = (struct inode *) malloc(sizeof(struct inode)) [L6874] 0 whoop_file_3 = (struct file *) malloc(sizeof(struct file)) [L6875] 0 whoop_inode_4 = (struct inode *) malloc(sizeof(struct inode)) [L6876] 0 whoop_file_4 = (struct file *) malloc(sizeof(struct file)) [L6877] 0 whoop_pci_dev = (struct pci_dev *) malloc(sizeof(struct pci_dev)) [L6878] 0 whoop_buf = (char *) malloc(sizeof(char)) [L6879] 0 whoop_platform_device = (struct platform_device *) malloc(sizeof(struct platform_device)) [L6880] 0 whoop_vm_area_struct = (struct vm_area_struct *) malloc(sizeof(struct vm_area_struct)) [L6881] 0 whoop_cx_dev = (struct cx_dev *) malloc(sizeof(struct cx_dev)) [L6882] 0 whoop_poll_table = (poll_table *) malloc(sizeof(poll_table)) [L6883] 0 whoop_loff_t = (loff_t *) malloc(sizeof(loff_t)) [L6884] 0 *whoop_loff_t = __VERIFIER_nondet_longlong() [L6885] 0 whoop_int = __VERIFIER_nondet_int() [L6886] CALL 0 assume_abort_if_not(whoop_int >= 0) [L171] COND FALSE 0 !(!cond) [L6886] RET 0 assume_abort_if_not(whoop_int >= 0) [L6887] CALL, EXPR 0 _whoop_init() [L6804] 0 int ret = 0; [L6805-L6806] CALL 0 printk("\001" "6" "Generic non-volatile memory driver v%s\n", "1.1") [L6650] 0 return __VERIFIER_nondet_int(); [L6805-L6806] RET 0 printk("\001" "6" "Generic non-volatile memory driver v%s\n", "1.1") [L6807] CALL, EXPR 0 misc_register(&nvram_dev) [L6624] 0 return __VERIFIER_nondet_int(); [L6807] RET, EXPR 0 misc_register(&nvram_dev) [L6807] 0 ret = misc_register(&nvram_dev) [L6808] COND FALSE 0 !(ret != 0) [L6810] CALL, EXPR 0 nvram_get_size() [L6632] 0 return __VERIFIER_nondet_long(); [L6810] RET, EXPR 0 nvram_get_size() [L6810] 0 nvram_len = nvram_get_size() [L6811] COND TRUE 0 nvram_len < 0 [L6812] 0 nvram_len = 8192 [L6814] 0 return ret; [L6887] RET, EXPR 0 _whoop_init() [L6887] 0 int _whoop_init_result = _whoop_init(); [L6888] 0 pthread_t pthread_t_write_nvram; [L6889] 0 pthread_t pthread_t_read_nvram; [L6890] FCALL, FORK 0 pthread_create(&pthread_t_write_nvram, ((void *)0), whoop_wrapper_write_nvram, ((void *)0)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, _whoop_init_result=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, pthread_t_write_nvram=-1, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6842] CALL 1 write_nvram(whoop_file_0, whoop_buf, whoop_int, whoop_loff_t) [L6744] 1 unsigned int i; [L6745] 1 const char *p = buf; [L6746] 1 char c = __VERIFIER_nondet_char(); [L6747] CALL, EXPR 1 access_ok(0, buf, count) [L6551] 1 return __VERIFIER_nondet_int(); [L6747] RET, EXPR 1 access_ok(0, buf, count) [L6747] COND FALSE 1 !(!access_ok(0, buf, count)) [L6750] EXPR 1 \read(*ppos) [L6750] 1 ssize_t lppos = *ppos; [L6752] COND FALSE 1 !(lppos >= nvram_len) VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=1, default_alloc_size=4, file={-14:0}, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:0}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6755] EXPR 1 \read(*ppos) [L6755] 1 lppos = *ppos [L6757] 1 i = lppos VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=1, default_alloc_size=4, file={-14:0}, i=8190, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:0}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6891] FCALL, FORK 0 pthread_create(&pthread_t_read_nvram, ((void *)0), whoop_wrapper_read_nvram, ((void *)0)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, _whoop_init_result=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, pthread_t_read_nvram=0, pthread_t_write_nvram=-1, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6847] CALL 2 read_nvram(whoop_file_1, whoop_buf, whoop_int, whoop_loff_t) [L6717] 2 unsigned int i; [L6718] 2 char *p = buf; [L6719] CALL, EXPR 2 access_ok(1, buf, count) [L6551] 2 return __VERIFIER_nondet_int(); [L6719] RET, EXPR 2 access_ok(1, buf, count) [L6719] COND FALSE 2 !(!access_ok(1, buf, count)) [L6722] EXPR 2 \read(*ppos) [L6722] 2 ssize_t lppos = *ppos; [L6724] COND FALSE 2 !(lppos >= nvram_len) VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=1, default_alloc_size=4, file={-17:0}, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:0}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6757] COND TRUE 1 count > 0 && i < nvram_len [L6758] CALL 1 __get_user(c, p) [L6535] 1 return __VERIFIER_nondet_int(); [L6758] RET 1 __get_user(c, p) [L6758] COND FALSE 1 !(__get_user(c, p)) [L6760] FCALL 1 nvram_write_byte(c, i) [L6757] 1 ++i [L6757] 1 ++p [L6757] 1 --count VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=0, default_alloc_size=4, file={-14:0}, i=8191, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6757] COND FALSE 1 !(count > 0 && i < nvram_len) VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=0, default_alloc_size=4, file={-14:0}, i=8191, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6763] 1 *ppos = i VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-14:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, c=0, count=0, default_alloc_size=4, file={-14:0}, i=8191, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6727] EXPR 2 \read(*ppos) [L6727] 2 lppos = *ppos [L6729] 2 i = lppos VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=1, default_alloc_size=4, file={-17:0}, i=8191, jiffies=0, lppos=8191, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:0}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6729] COND TRUE 2 count > 0 && i < nvram_len [L6730] CALL, EXPR 2 nvram_read_byte(i) [L6636] 2 return __VERIFIER_nondet_uchar(); [L6730] RET, EXPR 2 nvram_read_byte(i) [L6730] CALL 2 __put_user(nvram_read_byte(i), p) [L6543] 2 return __VERIFIER_nondet_int(); [L6730] RET 2 __put_user(nvram_read_byte(i), p) [L6730] COND FALSE 2 !(__put_user(nvram_read_byte(i), p)) [L6729] 2 ++i [L6729] 2 ++p [L6729] 2 --count VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=0, default_alloc_size=4, file={-17:0}, i=8192, jiffies=0, lppos=8191, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6729] COND FALSE 2 !(count > 0 && i < nvram_len) VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=0, default_alloc_size=4, file={-17:0}, i=8192, jiffies=0, lppos=8191, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6733] 2 *ppos = i VAL [\at(buf, Pre)={-10:0}, \at(count, Pre)=1, \at(file, Pre)={-17:0}, \at(ppos, Pre)={-2:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-10:0}, count=0, default_alloc_size=4, file={-17:0}, i=8192, jiffies=0, lppos=8191, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-10:1}, ppos={-2:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L6766] EXPR 1 \read(*ppos) [L6766] 1 lppos = *ppos [L6768] CALL 1 __VERIFIER_assert(lppos == i) [L174] COND TRUE 1 !(cond) VAL [\at(cond, Pre)=0, _whoop_exit={-1:5}, _whoop_init={-1:4}, cond=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] [L175] 1 reach_error() VAL [\at(cond, Pre)=0, _whoop_exit={-1:5}, _whoop_init={-1:4}, cond=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, whoop_buf={-10:0}, whoop_cx_dev={-13:0}, whoop_file_0={-14:0}, whoop_file_1={-17:0}, whoop_file_2={-3:0}, whoop_file_3={-6:0}, whoop_file_4={-18:0}, whoop_inode_0={-4:0}, whoop_inode_1={-9:0}, whoop_inode_2={-8:0}, whoop_inode_3={-11:0}, whoop_inode_4={-12:0}, whoop_int=1, whoop_loff_t={-2:0}, whoop_pci_dev={-5:0}, whoop_platform_device={-16:0}, whoop_poll_table={-7:0}, whoop_vm_area_struct={-15:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 79 locations, 98 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: whoop_wrapper_write_nvramThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 79 locations, 98 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 64.2s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 35.2s, 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: 219, 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.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 17312 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1886 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 1/15 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: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-25 00:21:43,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE