./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:32:57,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:32:57,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:32:57,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:32:57,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:32:57,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:32:57,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:32:57,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:32:57,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:32:57,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:32:57,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:32:57,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:32:57,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:32:57,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:32:57,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:32:57,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:32:57,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:32:57,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:32:57,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:32:57,489 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2025-03-08 17:32:57,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:32:57,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:32:57,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:32:57,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:32:57,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:32:57,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-08 17:32:58,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de880e4c1/1889c549dc8d479495204d16414fd33f/FLAG83ac10d7b [2025-03-08 17:32:59,144 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:32:59,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-08 17:32:59,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de880e4c1/1889c549dc8d479495204d16414fd33f/FLAG83ac10d7b [2025-03-08 17:32:59,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de880e4c1/1889c549dc8d479495204d16414fd33f [2025-03-08 17:32:59,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:32:59,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:32:59,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:32:59,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:32:59,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:32:59,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59, skipping insertion in model container [2025-03-08 17:32:59,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:32:59,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c[4345,4358] [2025-03-08 17:32:59,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:32:59,642 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:32:59,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c[4345,4358] [2025-03-08 17:32:59,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:32:59,699 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:32:59,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59 WrapperNode [2025-03-08 17:32:59,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:32:59,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:32:59,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:32:59,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:32:59,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,736 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 293 [2025-03-08 17:32:59,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:32:59,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:32:59,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:32:59,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:32:59,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,775 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 17:32:59,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:32:59,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:32:59,793 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:32:59,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:32:59,794 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (1/1) ... [2025-03-08 17:32:59,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:32:59,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:59,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:32:59,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:32:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:32:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:32:59,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:32:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:32:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:32:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:32:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:32:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-08 17:32:59,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-08 17:32:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:32:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:32:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:32:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:32:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:32:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:32:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:32:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:32:59,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:32:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:32:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:32:59,849 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:32:59,936 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:32:59,938 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:33:00,364 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:33:00,364 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:33:00,647 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:33:00,647 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:33:00,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:00 BoogieIcfgContainer [2025-03-08 17:33:00,649 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:33:00,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:33:00,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:33:00,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:33:00,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:59" (1/3) ... [2025-03-08 17:33:00,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491d7d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:00, skipping insertion in model container [2025-03-08 17:33:00,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:59" (2/3) ... [2025-03-08 17:33:00,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491d7d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:00, skipping insertion in model container [2025-03-08 17:33:00,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:00" (3/3) ... [2025-03-08 17:33:00,657 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-03-08 17:33:00,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:33:00,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 17:33:00,671 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:33:00,734 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 17:33:00,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 128 flow [2025-03-08 17:33:00,797 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2025-03-08 17:33:00,799 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 17:33:00,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 6/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-08 17:33:00,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 128 flow [2025-03-08 17:33:00,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 114 flow [2025-03-08 17:33:00,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:33:00,823 INFO L333 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=PETRI_NET, 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;@1e479d6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:33:00,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-08 17:33:00,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:33:00,840 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-03-08 17:33:00,840 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 17:33:00,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:00,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:00,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-08 17:33:00,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1705297120, now seen corresponding path program 1 times [2025-03-08 17:33:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:00,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796295983] [2025-03-08 17:33:00,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:00,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:33:01,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:33:01,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:01,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796295983] [2025-03-08 17:33:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796295983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:01,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:33:01,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556964495] [2025-03-08 17:33:01,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:01,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:33:01,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:01,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:33:01,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:33:01,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-08 17:33:01,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-03-08 17:33:01,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:01,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-08 17:33:01,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:02,725 INFO L124 PetriNetUnfolderBase]: 6485/9070 cut-off events. [2025-03-08 17:33:02,725 INFO L125 PetriNetUnfolderBase]: For 636/636 co-relation queries the response was YES. [2025-03-08 17:33:02,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18169 conditions, 9070 events. 6485/9070 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 48971 event pairs, 483 based on Foata normal form. 398/9440 useless extension candidates. Maximal degree in co-relation 16411. Up to 5031 conditions per place. [2025-03-08 17:33:02,781 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 90 selfloop transitions, 7 changer transitions 0/106 dead transitions. [2025-03-08 17:33:02,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 106 transitions, 463 flow [2025-03-08 17:33:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:33:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:33:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-03-08 17:33:02,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-08 17:33:02,794 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 114 flow. Second operand 6 states and 177 transitions. [2025-03-08 17:33:02,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 106 transitions, 463 flow [2025-03-08 17:33:02,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 106 transitions, 425 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-08 17:33:02,811 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 145 flow [2025-03-08 17:33:02,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-03-08 17:33:02,818 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2025-03-08 17:33:02,820 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 145 flow [2025-03-08 17:33:02,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-03-08 17:33:02,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:02,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:02,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:33:02,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-08 17:33:02,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash 687208092, now seen corresponding path program 1 times [2025-03-08 17:33:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777187217] [2025-03-08 17:33:02,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:02,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 17:33:02,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:33:02,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:02,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777187217] [2025-03-08 17:33:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777187217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566132716] [2025-03-08 17:33:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:02,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:02,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:02,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:02,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-08 17:33:02,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-03-08 17:33:02,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:02,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-08 17:33:02,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:03,587 INFO L124 PetriNetUnfolderBase]: 6233/8539 cut-off events. [2025-03-08 17:33:03,587 INFO L125 PetriNetUnfolderBase]: For 3433/3433 co-relation queries the response was YES. [2025-03-08 17:33:03,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20134 conditions, 8539 events. 6233/8539 cut-off events. For 3433/3433 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 44601 event pairs, 1559 based on Foata normal form. 254/8734 useless extension candidates. Maximal degree in co-relation 11362. Up to 6195 conditions per place. [2025-03-08 17:33:03,628 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 57 selfloop transitions, 2 changer transitions 3/71 dead transitions. [2025-03-08 17:33:03,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 318 flow [2025-03-08 17:33:03,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-08 17:33:03,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66 [2025-03-08 17:33:03,629 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 145 flow. Second operand 3 states and 99 transitions. [2025-03-08 17:33:03,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 318 flow [2025-03-08 17:33:03,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:33:03,633 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 146 flow [2025-03-08 17:33:03,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-08 17:33:03,634 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2025-03-08 17:33:03,634 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 146 flow [2025-03-08 17:33:03,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-03-08 17:33:03,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:03,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:03,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:33:03,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-08 17:33:03,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash -251397579, now seen corresponding path program 1 times [2025-03-08 17:33:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:03,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-03-08 17:33:03,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:03,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:03,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:33:03,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:33:03,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:03,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:03,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:03,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-03-08 17:33:03,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53170435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:03,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:03,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883090942] [2025-03-08 17:33:03,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:03,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:03,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:03,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:33:03,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-08 17:33:03,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:33:03,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:03,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-08 17:33:03,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:04,663 INFO L124 PetriNetUnfolderBase]: 7171/9854 cut-off events. [2025-03-08 17:33:04,664 INFO L125 PetriNetUnfolderBase]: For 4760/4767 co-relation queries the response was YES. [2025-03-08 17:33:04,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24072 conditions, 9854 events. 7171/9854 cut-off events. For 4760/4767 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 51763 event pairs, 5485 based on Foata normal form. 111/9835 useless extension candidates. Maximal degree in co-relation 14580. Up to 8231 conditions per place. [2025-03-08 17:33:04,710 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 40 selfloop transitions, 2 changer transitions 25/76 dead transitions. [2025-03-08 17:33:04,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 76 transitions, 347 flow [2025-03-08 17:33:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:33:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:33:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-08 17:33:04,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-08 17:33:04,712 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 146 flow. Second operand 4 states and 115 transitions. [2025-03-08 17:33:04,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 76 transitions, 347 flow [2025-03-08 17:33:04,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:04,720 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 160 flow [2025-03-08 17:33:04,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-03-08 17:33:04,721 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-03-08 17:33:04,721 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 160 flow [2025-03-08 17:33:04,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:33:04,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:04,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:04,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:33:04,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-08 17:33:04,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash -882781594, now seen corresponding path program 1 times [2025-03-08 17:33:04,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:04,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302456934] [2025-03-08 17:33:04,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:04,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:04,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 17:33:04,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 17:33:04,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:04,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:33:04,765 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:33:04,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 17:33:04,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 17:33:04,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:04,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:33:04,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:33:04,813 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:33:04,814 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-03-08 17:33:04,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-03-08 17:33:04,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-08 17:33:04,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-08 17:33:04,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-08 17:33:04,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:33:04,816 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 17:33:04,881 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:33:04,881 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:33:04,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:33:04 BasicIcfg [2025-03-08 17:33:04,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:33:04,886 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:33:04,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:33:04,886 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:33:04,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:00" (3/4) ... [2025-03-08 17:33:04,887 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 17:33:04,945 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 37. [2025-03-08 17:33:04,992 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:33:04,993 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:33:04,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:33:04,993 INFO L158 Benchmark]: Toolchain (without parser) took 5544.54ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 105.9MB in the beginning and 224.9MB in the end (delta: -119.0MB). Peak memory consumption was 325.5MB. Max. memory is 16.1GB. [2025-03-08 17:33:04,993 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:33:04,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.87ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 93.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:33:04,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.93ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:33:04,994 INFO L158 Benchmark]: Boogie Preprocessor took 55.42ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:33:04,994 INFO L158 Benchmark]: IcfgBuilder took 855.63ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 77.8MB in the end (delta: 10.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-03-08 17:33:04,994 INFO L158 Benchmark]: TraceAbstraction took 4234.39ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 77.0MB in the beginning and 245.8MB in the end (delta: -168.8MB). Peak memory consumption was 269.0MB. Max. memory is 16.1GB. [2025-03-08 17:33:04,994 INFO L158 Benchmark]: Witness Printer took 107.23ms. Allocated memory is still 587.2MB. Free memory was 245.8MB in the beginning and 224.9MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 17:33:04,995 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.14ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.87ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 93.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.93ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.42ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 855.63ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 77.8MB in the end (delta: 10.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4234.39ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 77.0MB in the beginning and 245.8MB in the end (delta: -168.8MB). Peak memory consumption was 269.0MB. Max. memory is 16.1GB. * Witness Printer took 107.23ms. Allocated memory is still 587.2MB. Free memory was 245.8MB in the beginning and 224.9MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 154]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L40] 0 int* q1; [L41] 0 int* q2; [L42] 0 int i, j, total, C, N, M, q1_front, q1_back, q2_front, q2_back, n1, n2; [L124] 0 pthread_t t1, t2, t3, t4; [L126] 0 C = __VERIFIER_nondet_int() [L127] 0 M = __VERIFIER_nondet_int() [L128] 0 N = __VERIFIER_nondet_int() [L130] 0 q1_front = __VERIFIER_nondet_int() [L131] 0 q1_back = __VERIFIER_nondet_int() [L132] 0 q2_front = __VERIFIER_nondet_int() [L133] 0 q2_back = __VERIFIER_nondet_int() [L135] 0 n1 = __VERIFIER_nondet_int() [L136] 0 n2 = __VERIFIER_nondet_int() [L137] CALL, EXPR 0 create_fresh_int_array(n1) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND TRUE 0 i < size [L165] 0 arr[i] = __VERIFIER_nondet_int() [L164] 0 i++ VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n1) [L137] 0 q1 = create_fresh_int_array(n1) [L138] CALL, EXPR 0 create_fresh_int_array(n2) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=0, arr={-4:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n2) [L138] 0 q2 = create_fresh_int_array(n2) [L140] CALL 0 assume_abort_if_not(C > -2147483648) [L37] COND FALSE 0 !(!cond) [L140] RET 0 assume_abort_if_not(C > -2147483648) [L141] CALL 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L37] COND FALSE 0 !(!cond) [L141] RET 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L144] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, total=0] [L49] 1 _Bool cond = i < N; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1[q1_back] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L37] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L54] 1 i++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L145] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, total=0] [L69] 2 _Bool cond = j < M; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L146] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, total=0] [L89] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L57] 1 q1_back++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L71] COND FALSE 2 !(\read(cond)) [L84] 2 return 0; [L60] 1 cond = i < N VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L64] 1 return 0; [L147] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L107] 4 _Bool cond = j < M || q2_front < q2_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L109] COND FALSE 4 !(\read(cond)) [L120] 4 return 0; [L91] COND FALSE 3 !(\read(cond)) [L102] 3 return 0; [L148] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L149] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L150] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L151] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] [L153] CALL 0 assume_abort_if_not(total <= 0) [L37] COND FALSE 0 !(!cond) [L153] RET 0 assume_abort_if_not(total <= 0) [L154] 0 reach_error() VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=0] - UnprovableResult [Line: 146]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 144]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 75 locations, 84 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 2 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=3, InterpolantAutomatonStates: 13, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 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-03-08 17:33:05,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-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