./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 551b0097
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-09 21:25:22,782 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-09 21:25:22,845 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-01-09 21:25:22,852 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-09 21:25:22,852 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-09 21:25:22,877 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-09 21:25:22,878 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-09 21:25:22,878 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-09 21:25:22,878 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-01-09 21:25:22,878 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-01-09 21:25:22,879 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-09 21:25:22,879 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-09 21:25:22,879 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-09 21:25:22,879 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-09 21:25:22,879 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-01-09 21:25:22,879 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-01-09 21:25:22,879 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-09 21:25:22,879 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-09 21:25:22,880 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-09 21:25:22,881 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-01-09 21:25:22,881 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 21:25:22,881 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 21:25:22,881 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 21:25:22,881 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-09 21:25:22,881 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 21:25:22,881 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 21:25:22,881 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 21:25:22,882 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-09 21:25:22,882 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-01-09 21:25:22,882 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-01-09 21:25:22,882 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-01-09 21:25:22,882 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-09 21:25:22,882 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-01-09 21:25:22,882 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-01-09 21:25:22,882 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-01-09 21:25:22,882 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-01-09 21:25:22,883 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-01-09 21:25:22,883 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-jdk21/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 ! data-race) )


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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112
[2025-01-09 21:25:23,136 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-09 21:25:23,145 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-09 21:25:23,147 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-09 21:25:23,148 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-09 21:25:23,149 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-09 21:25:23,151 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i
[2025-01-09 21:25:24,450 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e5bb86b1/9c999c8878864160a20e0dcee11738fd/FLAGf0345cf2b
[2025-01-09 21:25:24,856 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-09 21:25:24,857 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i
[2025-01-09 21:25:24,881 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e5bb86b1/9c999c8878864160a20e0dcee11738fd/FLAGf0345cf2b
[2025-01-09 21:25:25,045 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e5bb86b1/9c999c8878864160a20e0dcee11738fd
[2025-01-09 21:25:25,047 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-09 21:25:25,048 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-09 21:25:25,049 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-09 21:25:25,050 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-09 21:25:25,053 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-09 21:25:25,054 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,054 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21938a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25, skipping insertion in model container
[2025-01-09 21:25:25,055 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,100 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-09 21:25:25,484 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 21:25:25,500 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-09 21:25:25,576 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 21:25:25,645 INFO  L204         MainTranslator]: Completed translation
[2025-01-09 21:25:25,646 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25 WrapperNode
[2025-01-09 21:25:25,646 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-09 21:25:25,647 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-09 21:25:25,647 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-09 21:25:25,647 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-09 21:25:25,651 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,672 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,712 INFO  L138                Inliner]: procedures = 370, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 243
[2025-01-09 21:25:25,712 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-09 21:25:25,717 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-09 21:25:25,717 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-09 21:25:25,717 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-09 21:25:25,723 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,724 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,734 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,734 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,757 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,761 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,764 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,765 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,766 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,773 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-09 21:25:25,775 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-09 21:25:25,775 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-09 21:25:25,776 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-09 21:25:25,776 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (1/1) ...
[2025-01-09 21:25:25,782 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 21:25:25,792 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 21:25:25,805 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-01-09 21:25:25,809 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-01-09 21:25:25,829 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2025-01-09 21:25:25,829 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2025-01-09 21:25:25,829 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2025-01-09 21:25:25,830 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-01-09 21:25:25,830 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-01-09 21:25:25,830 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2025-01-09 21:25:25,830 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-01-09 21:25:25,830 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-09 21:25:25,830 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2025-01-09 21:25:25,830 INFO  L130     BoogieDeclarations]: Found specification of procedure t_fun
[2025-01-09 21:25:25,830 INFO  L138     BoogieDeclarations]: Found implementation of procedure t_fun
[2025-01-09 21:25:25,831 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-01-09 21:25:25,831 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-09 21:25:25,831 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-09 21:25:25,832 WARN  L203             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-01-09 21:25:25,974 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-09 21:25:25,976 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-09 21:25:26,440 INFO  L279             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-01-09 21:25:26,441 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-09 21:25:26,478 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-09 21:25:26,478 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-01-09 21:25:26,479 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:26 BoogieIcfgContainer
[2025-01-09 21:25:26,479 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-09 21:25:26,484 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-01-09 21:25:26,485 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-01-09 21:25:26,488 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-01-09 21:25:26,489 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:25:25" (1/3) ...
[2025-01-09 21:25:26,489 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f52736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:26, skipping insertion in model container
[2025-01-09 21:25:26,489 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:25" (2/3) ...
[2025-01-09 21:25:26,489 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f52736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:26, skipping insertion in model container
[2025-01-09 21:25:26,489 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:26" (3/3) ...
[2025-01-09 21:25:26,490 INFO  L128   eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i
[2025-01-09 21:25:26,501 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-01-09 21:25:26,502 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_26-alloc_region_rc.i that has 2 procedures, 272 locations, 1 initial locations, 1 loop locations, and 20 error locations.
[2025-01-09 21:25:26,502 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-01-09 21:25:26,622 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-01-09 21:25:26,667 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 275 places, 273 transitions, 550 flow
[2025-01-09 21:25:26,785 INFO  L124   PetriNetUnfolderBase]: 2/272 cut-off events.
[2025-01-09 21:25:26,789 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-01-09 21:25:26,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 276 conditions, 272 events. 2/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 258 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. 
[2025-01-09 21:25:26,797 INFO  L82        GeneralOperation]: Start removeDead. Operand has 275 places, 273 transitions, 550 flow
[2025-01-09 21:25:26,806 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 274 places, 272 transitions, 547 flow
[2025-01-09 21:25:26,817 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-01-09 21:25:26,832 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;@171a3dad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-01-09 21:25:26,832 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 28 error locations.
[2025-01-09 21:25:26,840 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-01-09 21:25:26,841 INFO  L124   PetriNetUnfolderBase]: 0/30 cut-off events.
[2025-01-09 21:25:26,842 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-01-09 21:25:26,842 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:25:26,843 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]
[2025-01-09 21:25:26,843 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:25:26,848 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:25:26,848 INFO  L85        PathProgramCache]: Analyzing trace with hash -527324182, now seen corresponding path program 1 times
[2025-01-09 21:25:26,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:25:26,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641344591]
[2025-01-09 21:25:26,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 21:25:26,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:25:26,932 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-01-09 21:25:26,967 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-01-09 21:25:26,968 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 21:25:26,968 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:25:27,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:25:27,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:25:27,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641344591]
[2025-01-09 21:25:27,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641344591] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:25:27,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:25:27,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 21:25:27,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884165464]
[2025-01-09 21:25:27,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:25:27,598 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 21:25:27,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:25:27,620 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 21:25:27,621 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-01-09 21:25:28,195 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 273
[2025-01-09 21:25:28,203 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 547 flow. Second operand  has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 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-01-09 21:25:28,204 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:25:28,204 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 273
[2025-01-09 21:25:28,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:25:29,067 INFO  L124   PetriNetUnfolderBase]: 1377/5015 cut-off events.
[2025-01-09 21:25:29,067 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2025-01-09 21:25:29,079 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7809 conditions, 5015 events. 1377/5015 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 37623 event pairs, 1344 based on Foata normal form. 36/4687 useless extension candidates. Maximal degree in co-relation 7712. Up to 2785 conditions per place. 
[2025-01-09 21:25:29,099 INFO  L140   encePairwiseOnDemand]: 266/273 looper letters, 92 selfloop transitions, 5 changer transitions 0/270 dead transitions.
[2025-01-09 21:25:29,099 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 270 transitions, 737 flow
[2025-01-09 21:25:29,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 21:25:29,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 21:25:29,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1143 transitions.
[2025-01-09 21:25:29,122 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6978021978021978
[2025-01-09 21:25:29,124 INFO  L175             Difference]: Start difference. First operand has 274 places, 272 transitions, 547 flow. Second operand 6 states and 1143 transitions.
[2025-01-09 21:25:29,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 270 transitions, 737 flow
[2025-01-09 21:25:29,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 270 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-01-09 21:25:29,137 INFO  L231             Difference]: Finished difference. Result has 277 places, 270 transitions, 552 flow
[2025-01-09 21:25:29,140 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=277, PETRI_TRANSITIONS=270}
[2025-01-09 21:25:29,144 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 3 predicate places.
[2025-01-09 21:25:29,144 INFO  L471      AbstractCegarLoop]: Abstraction has has 277 places, 270 transitions, 552 flow
[2025-01-09 21:25:29,145 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 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-01-09 21:25:29,145 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:25:29,146 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, 1, 1, 1, 1, 1]
[2025-01-09 21:25:29,146 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-01-09 21:25:29,146 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:25:29,147 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:25:29,147 INFO  L85        PathProgramCache]: Analyzing trace with hash 940357652, now seen corresponding path program 1 times
[2025-01-09 21:25:29,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:25:29,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283318309]
[2025-01-09 21:25:29,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 21:25:29,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:25:29,169 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-01-09 21:25:29,179 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-01-09 21:25:29,181 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 21:25:29,181 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:25:29,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:25:29,596 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:25:29,596 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283318309]
[2025-01-09 21:25:29,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283318309] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:25:29,596 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:25:29,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 21:25:29,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110993046]
[2025-01-09 21:25:29,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:25:29,597 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 21:25:29,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:25:29,599 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 21:25:29,599 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-01-09 21:25:30,217 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 201 out of 273
[2025-01-09 21:25:30,219 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 270 transitions, 552 flow. Second operand  has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 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-01-09 21:25:30,219 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:25:30,219 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 273
[2025-01-09 21:25:30,220 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:25:31,092 INFO  L124   PetriNetUnfolderBase]: 762/4094 cut-off events.
[2025-01-09 21:25:31,093 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2025-01-09 21:25:31,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5678 conditions, 4094 events. 762/4094 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 31513 event pairs, 460 based on Foata normal form. 0/3734 useless extension candidates. Maximal degree in co-relation 5631. Up to 1372 conditions per place. 
[2025-01-09 21:25:31,119 INFO  L140   encePairwiseOnDemand]: 241/273 looper letters, 81 selfloop transitions, 90 changer transitions 0/370 dead transitions.
[2025-01-09 21:25:31,119 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 370 transitions, 1094 flow
[2025-01-09 21:25:31,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 21:25:31,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 21:25:31,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions.
[2025-01-09 21:25:31,123 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8418803418803419
[2025-01-09 21:25:31,124 INFO  L175             Difference]: Start difference. First operand has 277 places, 270 transitions, 552 flow. Second operand 6 states and 1379 transitions.
[2025-01-09 21:25:31,124 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 370 transitions, 1094 flow
[2025-01-09 21:25:31,126 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 370 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-01-09 21:25:31,173 INFO  L231             Difference]: Finished difference. Result has 281 places, 353 transitions, 1118 flow
[2025-01-09 21:25:31,174 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1118, PETRI_PLACES=281, PETRI_TRANSITIONS=353}
[2025-01-09 21:25:31,175 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 7 predicate places.
[2025-01-09 21:25:31,175 INFO  L471      AbstractCegarLoop]: Abstraction has has 281 places, 353 transitions, 1118 flow
[2025-01-09 21:25:31,176 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 202.83333333333334) internal successors, (1217), 6 states have internal predecessors, (1217), 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-01-09 21:25:31,176 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:25:31,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 21:25:31,176 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-01-09 21:25:31,177 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:25:31,177 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:25:31,177 INFO  L85        PathProgramCache]: Analyzing trace with hash 1512683605, now seen corresponding path program 1 times
[2025-01-09 21:25:31,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:25:31,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576361621]
[2025-01-09 21:25:31,178 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 21:25:31,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:25:31,197 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes.
[2025-01-09 21:25:31,204 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements.
[2025-01-09 21:25:31,207 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 21:25:31,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:25:31,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:25:31,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:25:31,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576361621]
[2025-01-09 21:25:31,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576361621] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:25:31,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:25:31,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 21:25:31,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700061462]
[2025-01-09 21:25:31,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:25:31,494 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 21:25:31,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:25:31,494 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 21:25:31,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-01-09 21:25:31,832 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 273
[2025-01-09 21:25:31,833 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 353 transitions, 1118 flow. Second operand  has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 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-01-09 21:25:31,833 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:25:31,833 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 273
[2025-01-09 21:25:31,833 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:25:32,984 INFO  L124   PetriNetUnfolderBase]: 2110/7422 cut-off events.
[2025-01-09 21:25:32,984 INFO  L125   PetriNetUnfolderBase]: For 1551/1556 co-relation queries the response was YES.
[2025-01-09 21:25:33,003 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13852 conditions, 7422 events. 2110/7422 cut-off events. For 1551/1556 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 59997 event pairs, 1264 based on Foata normal form. 0/6804 useless extension candidates. Maximal degree in co-relation 13747. Up to 4041 conditions per place. 
[2025-01-09 21:25:33,032 INFO  L140   encePairwiseOnDemand]: 232/273 looper letters, 187 selfloop transitions, 123 changer transitions 0/485 dead transitions.
[2025-01-09 21:25:33,032 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 485 transitions, 2162 flow
[2025-01-09 21:25:33,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 21:25:33,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 21:25:33,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions.
[2025-01-09 21:25:33,037 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7881562881562881
[2025-01-09 21:25:33,037 INFO  L175             Difference]: Start difference. First operand has 281 places, 353 transitions, 1118 flow. Second operand 6 states and 1291 transitions.
[2025-01-09 21:25:33,037 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 485 transitions, 2162 flow
[2025-01-09 21:25:33,051 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 485 transitions, 2162 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-01-09 21:25:33,059 INFO  L231             Difference]: Finished difference. Result has 290 places, 469 transitions, 2070 flow
[2025-01-09 21:25:33,059 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2070, PETRI_PLACES=290, PETRI_TRANSITIONS=469}
[2025-01-09 21:25:33,060 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 16 predicate places.
[2025-01-09 21:25:33,060 INFO  L471      AbstractCegarLoop]: Abstraction has has 290 places, 469 transitions, 2070 flow
[2025-01-09 21:25:33,061 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 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-01-09 21:25:33,062 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:25:33,062 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, 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-01-09 21:25:33,062 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-01-09 21:25:33,062 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:25:33,063 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:25:33,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -1900410785, now seen corresponding path program 1 times
[2025-01-09 21:25:33,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:25:33,064 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548270283]
[2025-01-09 21:25:33,064 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 21:25:33,064 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:25:33,086 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-01-09 21:25:33,094 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-01-09 21:25:33,094 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 21:25:33,094 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:25:33,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:25:33,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:25:33,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548270283]
[2025-01-09 21:25:33,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548270283] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:25:33,454 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:25:33,454 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 21:25:33,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959394581]
[2025-01-09 21:25:33,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:25:33,454 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 21:25:33,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:25:33,455 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 21:25:33,455 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-01-09 21:25:33,893 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 273
[2025-01-09 21:25:33,895 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 469 transitions, 2070 flow. Second operand  has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 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-01-09 21:25:33,895 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:25:33,895 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 273
[2025-01-09 21:25:33,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:25:35,100 INFO  L124   PetriNetUnfolderBase]: 2411/8366 cut-off events.
[2025-01-09 21:25:35,101 INFO  L125   PetriNetUnfolderBase]: For 3692/3703 co-relation queries the response was YES.
[2025-01-09 21:25:35,120 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17817 conditions, 8366 events. 2411/8366 cut-off events. For 3692/3703 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 68345 event pairs, 1292 based on Foata normal form. 0/7722 useless extension candidates. Maximal degree in co-relation 17698. Up to 4366 conditions per place. 
[2025-01-09 21:25:35,149 INFO  L140   encePairwiseOnDemand]: 232/273 looper letters, 299 selfloop transitions, 123 changer transitions 0/601 dead transitions.
[2025-01-09 21:25:35,150 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 601 transitions, 3562 flow
[2025-01-09 21:25:35,150 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 21:25:35,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 21:25:35,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions.
[2025-01-09 21:25:35,154 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7881562881562881
[2025-01-09 21:25:35,154 INFO  L175             Difference]: Start difference. First operand has 290 places, 469 transitions, 2070 flow. Second operand 6 states and 1291 transitions.
[2025-01-09 21:25:35,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 601 transitions, 3562 flow
[2025-01-09 21:25:35,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 601 transitions, 3402 flow, removed 80 selfloop flow, removed 0 redundant places.
[2025-01-09 21:25:35,175 INFO  L231             Difference]: Finished difference. Result has 299 places, 585 transitions, 3086 flow
[2025-01-09 21:25:35,177 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1908, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3086, PETRI_PLACES=299, PETRI_TRANSITIONS=585}
[2025-01-09 21:25:35,178 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 25 predicate places.
[2025-01-09 21:25:35,178 INFO  L471      AbstractCegarLoop]: Abstraction has has 299 places, 585 transitions, 3086 flow
[2025-01-09 21:25:35,179 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 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-01-09 21:25:35,179 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:25:35,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:25:35,180 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-01-09 21:25:35,181 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:25:35,182 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:25:35,183 INFO  L85        PathProgramCache]: Analyzing trace with hash 1673401969, now seen corresponding path program 1 times
[2025-01-09 21:25:35,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:25:35,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110869570]
[2025-01-09 21:25:35,183 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 21:25:35,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:25:35,207 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-01-09 21:25:35,219 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-01-09 21:25:35,220 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 21:25:35,220 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:25:35,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:25:35,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:25:35,894 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110869570]
[2025-01-09 21:25:35,894 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110869570] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:25:35,894 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:25:35,894 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 21:25:35,894 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010520487]
[2025-01-09 21:25:35,895 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:25:35,895 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 21:25:35,895 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:25:35,896 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 21:25:35,896 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-01-09 21:25:36,277 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 180 out of 273
[2025-01-09 21:25:36,279 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 585 transitions, 3086 flow. Second operand  has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 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-01-09 21:25:36,279 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:25:36,279 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 273
[2025-01-09 21:25:36,279 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:25:37,654 INFO  L124   PetriNetUnfolderBase]: 2735/9170 cut-off events.
[2025-01-09 21:25:37,654 INFO  L125   PetriNetUnfolderBase]: For 5379/5442 co-relation queries the response was YES.
[2025-01-09 21:25:37,672 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21670 conditions, 9170 events. 2735/9170 cut-off events. For 5379/5442 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 75300 event pairs, 1246 based on Foata normal form. 0/8504 useless extension candidates. Maximal degree in co-relation 21538. Up to 4881 conditions per place. 
[2025-01-09 21:25:37,698 INFO  L140   encePairwiseOnDemand]: 230/273 looper letters, 360 selfloop transitions, 180 changer transitions 0/768 dead transitions.
[2025-01-09 21:25:37,699 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 768 transitions, 4754 flow
[2025-01-09 21:25:37,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 21:25:37,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 21:25:37,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1338 transitions.
[2025-01-09 21:25:37,705 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8168498168498168
[2025-01-09 21:25:37,705 INFO  L175             Difference]: Start difference. First operand has 299 places, 585 transitions, 3086 flow. Second operand 6 states and 1338 transitions.
[2025-01-09 21:25:37,705 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 768 transitions, 4754 flow
[2025-01-09 21:25:37,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 768 transitions, 4358 flow, removed 198 selfloop flow, removed 0 redundant places.
[2025-01-09 21:25:37,735 INFO  L231             Difference]: Finished difference. Result has 309 places, 752 transitions, 4086 flow
[2025-01-09 21:25:37,737 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=2702, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4086, PETRI_PLACES=309, PETRI_TRANSITIONS=752}
[2025-01-09 21:25:37,740 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 35 predicate places.
[2025-01-09 21:25:37,740 INFO  L471      AbstractCegarLoop]: Abstraction has has 309 places, 752 transitions, 4086 flow
[2025-01-09 21:25:37,741 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 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-01-09 21:25:37,744 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:25:37,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:25:37,744 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-01-09 21:25:37,744 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:25:37,745 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:25:37,745 INFO  L85        PathProgramCache]: Analyzing trace with hash 1877789814, now seen corresponding path program 1 times
[2025-01-09 21:25:37,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:25:37,745 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804463434]
[2025-01-09 21:25:37,745 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 21:25:37,745 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:25:37,767 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-01-09 21:25:37,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-01-09 21:25:37,781 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 21:25:37,781 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:25:38,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:25:38,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:25:38,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804463434]
[2025-01-09 21:25:38,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804463434] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:25:38,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:25:38,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 21:25:38,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932606406]
[2025-01-09 21:25:38,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:25:38,253 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-01-09 21:25:38,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:25:38,254 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-01-09 21:25:38,254 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-01-09 21:25:38,670 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 180 out of 273
[2025-01-09 21:25:38,671 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 752 transitions, 4086 flow. Second operand  has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 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-01-09 21:25:38,671 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:25:38,671 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 273
[2025-01-09 21:25:38,671 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:25:40,215 INFO  L124   PetriNetUnfolderBase]: 3192/10515 cut-off events.
[2025-01-09 21:25:40,215 INFO  L125   PetriNetUnfolderBase]: For 8626/8717 co-relation queries the response was YES.
[2025-01-09 21:25:40,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27972 conditions, 10515 events. 3192/10515 cut-off events. For 8626/8717 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 87900 event pairs, 1284 based on Foata normal form. 0/9822 useless extension candidates. Maximal degree in co-relation 27835. Up to 5371 conditions per place. 
[2025-01-09 21:25:40,281 INFO  L140   encePairwiseOnDemand]: 230/273 looper letters, 513 selfloop transitions, 180 changer transitions 0/935 dead transitions.
[2025-01-09 21:25:40,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 935 transitions, 6354 flow
[2025-01-09 21:25:40,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 21:25:40,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-01-09 21:25:40,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1338 transitions.
[2025-01-09 21:25:40,285 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8168498168498168
[2025-01-09 21:25:40,286 INFO  L175             Difference]: Start difference. First operand has 309 places, 752 transitions, 4086 flow. Second operand 6 states and 1338 transitions.
[2025-01-09 21:25:40,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 935 transitions, 6354 flow
[2025-01-09 21:25:40,329 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 935 transitions, 6300 flow, removed 27 selfloop flow, removed 0 redundant places.
[2025-01-09 21:25:40,342 INFO  L231             Difference]: Finished difference. Result has 319 places, 919 transitions, 5722 flow
[2025-01-09 21:25:40,343 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=4032, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5722, PETRI_PLACES=319, PETRI_TRANSITIONS=919}
[2025-01-09 21:25:40,344 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 45 predicate places.
[2025-01-09 21:25:40,344 INFO  L471      AbstractCegarLoop]: Abstraction has has 319 places, 919 transitions, 5722 flow
[2025-01-09 21:25:40,344 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 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-01-09 21:25:40,345 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:25:40,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:25:40,345 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-01-09 21:25:40,345 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:25:40,345 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:25:40,346 INFO  L85        PathProgramCache]: Analyzing trace with hash 482397346, now seen corresponding path program 1 times
[2025-01-09 21:25:40,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:25:40,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627173217]
[2025-01-09 21:25:40,347 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 21:25:40,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:25:40,370 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-01-09 21:25:40,383 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-01-09 21:25:40,386 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 21:25:40,387 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:25:41,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:25:41,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:25:41,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627173217]
[2025-01-09 21:25:41,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627173217] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:25:41,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:25:41,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-01-09 21:25:41,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306655346]
[2025-01-09 21:25:41,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:25:41,356 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-01-09 21:25:41,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:25:41,358 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-01-09 21:25:41,358 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2025-01-09 21:25:43,629 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273
[2025-01-09 21:25:43,631 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 919 transitions, 5722 flow. Second operand  has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-01-09 21:25:43,631 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:25:43,631 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273
[2025-01-09 21:25:43,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:25:47,849 INFO  L124   PetriNetUnfolderBase]: 4080/12657 cut-off events.
[2025-01-09 21:25:47,849 INFO  L125   PetriNetUnfolderBase]: For 15501/15596 co-relation queries the response was YES.
[2025-01-09 21:25:47,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38134 conditions, 12657 events. 4080/12657 cut-off events. For 15501/15596 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 105376 event pairs, 787 based on Foata normal form. 37/12063 useless extension candidates. Maximal degree in co-relation 37985. Up to 4181 conditions per place. 
[2025-01-09 21:25:47,956 INFO  L140   encePairwiseOnDemand]: 216/273 looper letters, 906 selfloop transitions, 252 changer transitions 0/1377 dead transitions.
[2025-01-09 21:25:47,956 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1377 transitions, 10662 flow
[2025-01-09 21:25:47,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2025-01-09 21:25:47,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2025-01-09 21:25:47,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4735 transitions.
[2025-01-09 21:25:47,967 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6670893209354748
[2025-01-09 21:25:47,968 INFO  L175             Difference]: Start difference. First operand has 319 places, 919 transitions, 5722 flow. Second operand 26 states and 4735 transitions.
[2025-01-09 21:25:47,968 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 1377 transitions, 10662 flow
[2025-01-09 21:25:48,065 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 1377 transitions, 10302 flow, removed 180 selfloop flow, removed 0 redundant places.
[2025-01-09 21:25:48,082 INFO  L231             Difference]: Finished difference. Result has 363 places, 1001 transitions, 6977 flow
[2025-01-09 21:25:48,084 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=5362, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6977, PETRI_PLACES=363, PETRI_TRANSITIONS=1001}
[2025-01-09 21:25:48,085 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 89 predicate places.
[2025-01-09 21:25:48,085 INFO  L471      AbstractCegarLoop]: Abstraction has has 363 places, 1001 transitions, 6977 flow
[2025-01-09 21:25:48,087 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-01-09 21:25:48,088 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:25:48,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:25:48,088 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-01-09 21:25:48,088 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:25:48,089 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:25:48,089 INFO  L85        PathProgramCache]: Analyzing trace with hash 743987164, now seen corresponding path program 2 times
[2025-01-09 21:25:48,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:25:48,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760532118]
[2025-01-09 21:25:48,089 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-01-09 21:25:48,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:25:48,114 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 1 equivalence classes.
[2025-01-09 21:25:48,127 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-01-09 21:25:48,129 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-01-09 21:25:48,129 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:25:48,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:25:48,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:25:48,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760532118]
[2025-01-09 21:25:48,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760532118] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:25:48,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:25:48,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-01-09 21:25:48,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707770144]
[2025-01-09 21:25:48,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:25:48,647 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-01-09 21:25:48,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:25:48,650 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-01-09 21:25:48,650 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2025-01-09 21:25:50,736 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273
[2025-01-09 21:25:50,738 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 1001 transitions, 6977 flow. Second operand  has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-01-09 21:25:50,738 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:25:50,738 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273
[2025-01-09 21:25:50,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:25:54,225 INFO  L124   PetriNetUnfolderBase]: 5056/15659 cut-off events.
[2025-01-09 21:25:54,225 INFO  L125   PetriNetUnfolderBase]: For 27091/27414 co-relation queries the response was YES.
[2025-01-09 21:25:54,284 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51560 conditions, 15659 events. 5056/15659 cut-off events. For 27091/27414 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 135444 event pairs, 1280 based on Foata normal form. 51/14943 useless extension candidates. Maximal degree in co-relation 51391. Up to 2883 conditions per place. 
[2025-01-09 21:25:54,320 INFO  L140   encePairwiseOnDemand]: 215/273 looper letters, 1322 selfloop transitions, 193 changer transitions 0/1734 dead transitions.
[2025-01-09 21:25:54,321 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1734 transitions, 15673 flow
[2025-01-09 21:25:54,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-01-09 21:25:54,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2025-01-09 21:25:54,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3946 transitions.
[2025-01-09 21:25:54,330 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.657009657009657
[2025-01-09 21:25:54,330 INFO  L175             Difference]: Start difference. First operand has 363 places, 1001 transitions, 6977 flow. Second operand 22 states and 3946 transitions.
[2025-01-09 21:25:54,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1734 transitions, 15673 flow
[2025-01-09 21:25:54,469 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 1734 transitions, 15420 flow, removed 43 selfloop flow, removed 6 redundant places.
[2025-01-09 21:25:54,482 INFO  L231             Difference]: Finished difference. Result has 392 places, 1145 transitions, 9013 flow
[2025-01-09 21:25:54,483 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=6826, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1001, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9013, PETRI_PLACES=392, PETRI_TRANSITIONS=1145}
[2025-01-09 21:25:54,483 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 118 predicate places.
[2025-01-09 21:25:54,483 INFO  L471      AbstractCegarLoop]: Abstraction has has 392 places, 1145 transitions, 9013 flow
[2025-01-09 21:25:54,485 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-01-09 21:25:54,485 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:25:54,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:25:54,485 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-01-09 21:25:54,485 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:25:54,486 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:25:54,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 2127013216, now seen corresponding path program 3 times
[2025-01-09 21:25:54,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:25:54,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847070334]
[2025-01-09 21:25:54,486 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-01-09 21:25:54,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:25:54,501 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 1 equivalence classes.
[2025-01-09 21:25:54,509 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-01-09 21:25:54,510 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-01-09 21:25:54,510 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:25:55,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:25:55,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:25:55,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847070334]
[2025-01-09 21:25:55,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847070334] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:25:55,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:25:55,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-01-09 21:25:55,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800901229]
[2025-01-09 21:25:55,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:25:55,007 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-01-09 21:25:55,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:25:55,007 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-01-09 21:25:55,007 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2025-01-09 21:25:56,604 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273
[2025-01-09 21:25:56,606 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1145 transitions, 9013 flow. Second operand  has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-01-09 21:25:56,606 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:25:56,606 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273
[2025-01-09 21:25:56,606 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:26:01,132 INFO  L124   PetriNetUnfolderBase]: 5132/15682 cut-off events.
[2025-01-09 21:26:01,132 INFO  L125   PetriNetUnfolderBase]: For 34423/34710 co-relation queries the response was YES.
[2025-01-09 21:26:01,231 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55029 conditions, 15682 events. 5132/15682 cut-off events. For 34423/34710 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 135615 event pairs, 941 based on Foata normal form. 77/15030 useless extension candidates. Maximal degree in co-relation 54846. Up to 5166 conditions per place. 
[2025-01-09 21:26:01,281 INFO  L140   encePairwiseOnDemand]: 216/273 looper letters, 974 selfloop transitions, 345 changer transitions 0/1538 dead transitions.
[2025-01-09 21:26:01,282 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1538 transitions, 14837 flow
[2025-01-09 21:26:01,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-01-09 21:26:01,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2025-01-09 21:26:01,286 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3190 transitions.
[2025-01-09 21:26:01,287 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6873518638224521
[2025-01-09 21:26:01,287 INFO  L175             Difference]: Start difference. First operand has 392 places, 1145 transitions, 9013 flow. Second operand 17 states and 3190 transitions.
[2025-01-09 21:26:01,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 1538 transitions, 14837 flow
[2025-01-09 21:26:01,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 1538 transitions, 14578 flow, removed 97 selfloop flow, removed 2 redundant places.
[2025-01-09 21:26:01,519 INFO  L231             Difference]: Finished difference. Result has 417 places, 1219 transitions, 11185 flow
[2025-01-09 21:26:01,520 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=8862, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=11185, PETRI_PLACES=417, PETRI_TRANSITIONS=1219}
[2025-01-09 21:26:01,521 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 143 predicate places.
[2025-01-09 21:26:01,521 INFO  L471      AbstractCegarLoop]: Abstraction has has 417 places, 1219 transitions, 11185 flow
[2025-01-09 21:26:01,522 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-01-09 21:26:01,522 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:26:01,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:26:01,522 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-01-09 21:26:01,522 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:26:01,523 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:26:01,523 INFO  L85        PathProgramCache]: Analyzing trace with hash 1823839556, now seen corresponding path program 4 times
[2025-01-09 21:26:01,523 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:26:01,523 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6183768]
[2025-01-09 21:26:01,523 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-01-09 21:26:01,523 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:26:01,543 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes.
[2025-01-09 21:26:01,553 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements.
[2025-01-09 21:26:01,553 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-01-09 21:26:01,553 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:26:02,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:26:02,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:26:02,110 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6183768]
[2025-01-09 21:26:02,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6183768] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 21:26:02,110 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 21:26:02,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-01-09 21:26:02,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146386998]
[2025-01-09 21:26:02,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 21:26:02,110 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-01-09 21:26:02,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:26:02,111 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-01-09 21:26:02,111 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2025-01-09 21:26:04,109 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 273
[2025-01-09 21:26:04,111 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1219 transitions, 11185 flow. Second operand  has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-01-09 21:26:04,111 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:26:04,111 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 273
[2025-01-09 21:26:04,111 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:26:08,701 INFO  L124   PetriNetUnfolderBase]: 6077/18481 cut-off events.
[2025-01-09 21:26:08,701 INFO  L125   PetriNetUnfolderBase]: For 53341/53803 co-relation queries the response was YES.
[2025-01-09 21:26:08,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 68843 conditions, 18481 events. 6077/18481 cut-off events. For 53341/53803 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 165251 event pairs, 917 based on Foata normal form. 64/17739 useless extension candidates. Maximal degree in co-relation 68648. Up to 3546 conditions per place. 
[2025-01-09 21:26:08,894 INFO  L140   encePairwiseOnDemand]: 215/273 looper letters, 1397 selfloop transitions, 259 changer transitions 0/1875 dead transitions.
[2025-01-09 21:26:08,894 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 1875 transitions, 20317 flow
[2025-01-09 21:26:08,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-01-09 21:26:08,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2025-01-09 21:26:08,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3763 transitions.
[2025-01-09 21:26:08,898 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.656375370661085
[2025-01-09 21:26:08,898 INFO  L175             Difference]: Start difference. First operand has 417 places, 1219 transitions, 11185 flow. Second operand 21 states and 3763 transitions.
[2025-01-09 21:26:08,898 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 1875 transitions, 20317 flow
[2025-01-09 21:26:09,244 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 1875 transitions, 19986 flow, removed 113 selfloop flow, removed 6 redundant places.
[2025-01-09 21:26:09,262 INFO  L231             Difference]: Finished difference. Result has 445 places, 1314 transitions, 13378 flow
[2025-01-09 21:26:09,263 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=10976, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=976, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=13378, PETRI_PLACES=445, PETRI_TRANSITIONS=1314}
[2025-01-09 21:26:09,264 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 171 predicate places.
[2025-01-09 21:26:09,264 INFO  L471      AbstractCegarLoop]: Abstraction has has 445 places, 1314 transitions, 13378 flow
[2025-01-09 21:26:09,265 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 159.86666666666667) internal successors, (2398), 15 states have internal predecessors, (2398), 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-01-09 21:26:09,265 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:26:09,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:26:09,265 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-01-09 21:26:09,265 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:26:09,266 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:26:09,266 INFO  L85        PathProgramCache]: Analyzing trace with hash 1466590318, now seen corresponding path program 1 times
[2025-01-09 21:26:09,266 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:26:09,266 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026069678]
[2025-01-09 21:26:09,266 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 21:26:09,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:26:09,281 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-01-09 21:26:09,289 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-01-09 21:26:09,289 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 21:26:09,289 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:26:09,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:26:09,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:26:09,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026069678]
[2025-01-09 21:26:09,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026069678] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-09 21:26:09,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89275]
[2025-01-09 21:26:09,702 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 21:26:09,702 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 21:26:09,702 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 21:26:09,706 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-09 21:26:09,707 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-01-09 21:26:09,815 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-01-09 21:26:09,991 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-01-09 21:26:09,991 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 21:26:09,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:26:09,994 INFO  L256         TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjuncts are in the unsatisfiable core
[2025-01-09 21:26:10,000 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-09 21:26:10,039 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2025-01-09 21:26:10,084 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2025-01-09 21:26:10,085 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2025-01-09 21:26:10,116 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2025-01-09 21:26:10,130 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2025-01-09 21:26:10,145 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-01-09 21:26:10,146 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2025-01-09 21:26:10,170 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-01-09 21:26:10,170 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2025-01-09 21:26:10,204 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2025-01-09 21:26:10,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:26:10,216 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-09 21:26:10,257 WARN  L851   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|))) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ 3 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|))) is different from false
[2025-01-09 21:26:10,280 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|))) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) .cse1) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet30#1|))))) is different from false
[2025-01-09 21:26:10,302 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse2 |c_ULTIMATE.start_init_#t~nondet30#1|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) .cse1) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_755 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)))) (forall ((v_ArrVal_755 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|))) (forall ((v_ArrVal_755 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_755) |c_ULTIMATE.start_init_~p#1.base|) .cse2) |c_ULTIMATE.start_init_#t~nondet30#1|))))) is different from false
[2025-01-09 21:26:20,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:26:20,467 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [89275] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-09 21:26:20,467 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-09 21:26:20,467 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21
[2025-01-09 21:26:20,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97461888]
[2025-01-09 21:26:20,468 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-09 21:26:20,468 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-01-09 21:26:20,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:26:20,469 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-01-09 21:26:20,469 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=295, Unknown=3, NotChecked=108, Total=462
[2025-01-09 21:26:20,739 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 273
[2025-01-09 21:26:20,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 1314 transitions, 13378 flow. Second operand  has 22 states, 22 states have (on average 98.18181818181819) internal successors, (2160), 22 states have internal predecessors, (2160), 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-01-09 21:26:20,741 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:26:20,741 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 273
[2025-01-09 21:26:20,741 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-01-09 21:26:31,029 INFO  L124   PetriNetUnfolderBase]: 12412/30989 cut-off events.
[2025-01-09 21:26:31,029 INFO  L125   PetriNetUnfolderBase]: For 121629/121661 co-relation queries the response was YES.
[2025-01-09 21:26:31,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 123200 conditions, 30989 events. 12412/30989 cut-off events. For 121629/121661 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 270851 event pairs, 2848 based on Foata normal form. 45/29333 useless extension candidates. Maximal degree in co-relation 122979. Up to 12981 conditions per place. 
[2025-01-09 21:26:31,595 INFO  L140   encePairwiseOnDemand]: 221/273 looper letters, 2039 selfloop transitions, 254 changer transitions 0/2427 dead transitions.
[2025-01-09 21:26:31,595 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 2427 transitions, 28417 flow
[2025-01-09 21:26:31,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-01-09 21:26:31,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2025-01-09 21:26:31,599 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2888 transitions.
[2025-01-09 21:26:31,600 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.48085248085248083
[2025-01-09 21:26:31,600 INFO  L175             Difference]: Start difference. First operand has 445 places, 1314 transitions, 13378 flow. Second operand 22 states and 2888 transitions.
[2025-01-09 21:26:31,600 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 2427 transitions, 28417 flow
[2025-01-09 21:26:32,470 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 2427 transitions, 27927 flow, removed 173 selfloop flow, removed 6 redundant places.
[2025-01-09 21:26:32,499 INFO  L231             Difference]: Finished difference. Result has 475 places, 1470 transitions, 15768 flow
[2025-01-09 21:26:32,500 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=13004, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=15768, PETRI_PLACES=475, PETRI_TRANSITIONS=1470}
[2025-01-09 21:26:32,501 INFO  L279   CegarLoopForPetriNet]: 274 programPoint places, 201 predicate places.
[2025-01-09 21:26:32,501 INFO  L471      AbstractCegarLoop]: Abstraction has has 475 places, 1470 transitions, 15768 flow
[2025-01-09 21:26:32,502 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 98.18181818181819) internal successors, (2160), 22 states have internal predecessors, (2160), 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-01-09 21:26:32,502 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-01-09 21:26:32,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:26:32,509 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-01-09 21:26:32,702 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-01-09 21:26:32,703 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] ===
[2025-01-09 21:26:32,703 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 21:26:32,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 366988368, now seen corresponding path program 5 times
[2025-01-09 21:26:32,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 21:26:32,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036719133]
[2025-01-09 21:26:32,704 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-01-09 21:26:32,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 21:26:32,726 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes.
[2025-01-09 21:26:32,907 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements.
[2025-01-09 21:26:32,907 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-01-09 21:26:32,907 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:26:33,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:26:33,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 21:26:33,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036719133]
[2025-01-09 21:26:33,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036719133] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-09 21:26:33,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902392836]
[2025-01-09 21:26:33,400 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-01-09 21:26:33,400 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-09 21:26:33,400 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 21:26:33,403 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-09 21:26:33,405 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-01-09 21:26:33,512 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes.
[2025-01-09 21:26:33,553 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements.
[2025-01-09 21:26:33,554 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-01-09 21:26:33,554 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 21:26:33,556 INFO  L256         TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 33 conjuncts are in the unsatisfiable core
[2025-01-09 21:26:33,561 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-09 21:26:33,570 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2025-01-09 21:26:33,589 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2025-01-09 21:26:33,590 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2025-01-09 21:26:33,630 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2025-01-09 21:26:33,640 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2025-01-09 21:26:33,656 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-01-09 21:26:33,657 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2025-01-09 21:26:33,678 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-01-09 21:26:33,678 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2025-01-09 21:26:33,705 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32
[2025-01-09 21:26:33,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:26:33,720 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-01-09 21:26:33,749 WARN  L851   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_920 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_920 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|))) is different from false
[2025-01-09 21:26:33,772 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_920 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_920 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_920) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|))))) is different from false
[2025-01-09 21:26:46,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 21:26:46,558 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902392836] provided 0 perfect and 2 imperfect interpolant sequences
[2025-01-09 21:26:46,558 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-01-09 21:26:46,558 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 19
[2025-01-09 21:26:46,558 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382235306]
[2025-01-09 21:26:46,558 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-01-09 21:26:46,559 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-01-09 21:26:46,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 21:26:46,559 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-01-09 21:26:46,559 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=249, Unknown=12, NotChecked=66, Total=380
[2025-01-09 21:26:46,791 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 273
[2025-01-09 21:26:46,792 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 1470 transitions, 15768 flow. Second operand  has 20 states, 20 states have (on average 100.2) internal successors, (2004), 20 states have internal predecessors, (2004), 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-01-09 21:26:46,793 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-01-09 21:26:46,793 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 273
[2025-01-09 21:26:46,793 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand