./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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/weaver/popl20-bad-buffer-mult-alt2.wvr.c -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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:36,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:36,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:39:36,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:36,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:36,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:36,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:36,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:36,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:36,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:36,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:36,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:36,650 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:36,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:36,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:36,651 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:36,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:36,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:36,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:36,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:36,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:36,652 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:36,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:36,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:36,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:36,653 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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2025-02-08 05:39:36,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:36,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:36,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:36,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:36,877 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:36,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-02-08 05:39:38,113 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/871a2ca90/8c85c401b1eb43549d93ddd51d69266c/FLAGade3302c7 [2025-02-08 05:39:38,413 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:38,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-02-08 05:39:38,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/871a2ca90/8c85c401b1eb43549d93ddd51d69266c/FLAGade3302c7 [2025-02-08 05:39:38,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/871a2ca90/8c85c401b1eb43549d93ddd51d69266c [2025-02-08 05:39:38,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:38,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:38,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:38,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:38,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:38,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f564414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38, skipping insertion in model container [2025-02-08 05:39:38,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:38,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:38,883 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:38,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:38,918 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:38,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38 WrapperNode [2025-02-08 05:39:38,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:38,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:38,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:38,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:38,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,962 INFO L138 Inliner]: procedures = 25, calls = 56, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 597 [2025-02-08 05:39:38,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:38,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:38,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:38,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:38,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:38,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:38,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:38,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:38,993 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (1/1) ... [2025-02-08 05:39:38,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:39,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:39,037 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-02-08 05:39:39,046 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-02-08 05:39:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:39,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:39,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:39,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:39,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:39:39,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:39,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:39,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:39,063 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:39:39,144 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:39,146 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:39,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: #race~i~0 := 0; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc #t~short23#1; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: ~cond~2#1 := (if 0 == (if #t~short23#1 then 1 else 0) then 0 else 1); [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-2: assume 0 == #race~q1_back~0; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-2: assume !(0 == #race~q1_back~0); [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-3: #t~short23#1 := ~q1_front~0 < ~q1_back~0; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-4: assume 0 == #race~q1_front~0; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-4: assume !(0 == #race~q1_front~0); [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-5: #race~q1_back~0 := 0; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-6: assume #t~short23#1; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-6: assume !#t~short23#1; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-7: #race~q1_front~0 := 0; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-8: assume 0 == #race~N~0; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-8: assume !(0 == #race~N~0); [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-9: #t~short23#1 := ~i~0 < ~N~0; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-10: assume 0 == #race~i~0; [2025-02-08 05:39:39,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-10: assume !(0 == #race~i~0); [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-11: #race~N~0 := 0; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc #t~nondet20#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-1: havoc #t~ret19#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-2: assume #race~total~0 == #t~nondet20#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-2: assume !(#race~total~0 == #t~nondet20#1); [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-3: havoc #t~mem18#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-4: #race~total~0 := #t~nondet20#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-5: havoc #t~nondet20#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-6: ~total~0 := #t~ret19#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret19#1 && #t~ret19#1 <= 2147483647; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-10: #t~ret19#1 := plus_#res#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc #t~nondet22#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-1: assume #race~q1_front~0 == #t~nondet22#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-1: assume !(#race~q1_front~0 == #t~nondet22#1); [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-2: havoc #t~post21#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-3: #race~q1_front~0 := #t~nondet22#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-4: havoc #t~nondet22#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-5: ~q1_front~0 := 1 + #t~post21#1; [2025-02-08 05:39:39,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-6: assume 0 == #race~q1_front~0; [2025-02-08 05:39:39,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-6: assume !(0 == #race~q1_front~0); [2025-02-08 05:39:39,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-7: #t~post21#1 := ~q1_front~0; [2025-02-08 05:39:39,458 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-8: #race~q1_front~0 := 0; [2025-02-08 05:39:39,458 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: [2025-02-08 05:39:39,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: [2025-02-08 05:39:39,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: #race~j~0 := 0; [2025-02-08 05:39:39,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc #t~short32#1; [2025-02-08 05:39:39,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-1: ~cond~3#1 := (if 0 == (if #t~short32#1 then 1 else 0) then 0 else 1); [2025-02-08 05:39:39,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-2: assume 0 == #race~q2_back~0; [2025-02-08 05:39:39,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-2: assume !(0 == #race~q2_back~0); [2025-02-08 05:39:39,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-3: #t~short32#1 := ~q2_front~0 < ~q2_back~0; [2025-02-08 05:39:39,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-4: assume 0 == #race~q2_front~0; [2025-02-08 05:39:39,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-4: assume !(0 == #race~q2_front~0); [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-5: #race~q2_back~0 := 0; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-6: assume #t~short32#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-6: assume !#t~short32#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-7: #race~q2_front~0 := 0; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-8: assume 0 == #race~M~0; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-8: assume !(0 == #race~M~0); [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-9: #t~short32#1 := ~j~0 < ~M~0; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-10: assume 0 == #race~j~0; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-10: assume !(0 == #race~j~0); [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-11: #race~M~0 := 0; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc #t~nondet29#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: havoc #t~ret28#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-2: assume #race~total~0 == #t~nondet29#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-2: assume !(#race~total~0 == #t~nondet29#1); [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-3: havoc #t~mem27#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-4: #race~total~0 := #t~nondet29#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-5: havoc #t~nondet29#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-6: ~total~0 := #t~ret28#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-10: #t~ret28#1 := plus_#res#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc #t~nondet31#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: assume #race~q2_front~0 == #t~nondet31#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: assume !(#race~q2_front~0 == #t~nondet31#1); [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc #t~post30#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: #race~q2_front~0 := #t~nondet31#1; [2025-02-08 05:39:39,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-4: havoc #t~nondet31#1; [2025-02-08 05:39:39,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: ~q2_front~0 := 1 + #t~post30#1; [2025-02-08 05:39:39,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-6: assume 0 == #race~q2_front~0; [2025-02-08 05:39:39,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-6: assume !(0 == #race~q2_front~0); [2025-02-08 05:39:39,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: #t~post30#1 := ~q2_front~0; [2025-02-08 05:39:39,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: #race~q2_front~0 := 0; [2025-02-08 05:39:39,782 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:39,783 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:40,130 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L169 is not an error location. [2025-02-08 05:39:40,131 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L169 is not an error location. [2025-02-08 05:39:40,132 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:40,132 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:40,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:40 BoogieIcfgContainer [2025-02-08 05:39:40,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:40,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:40,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:40,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:40,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:38" (1/3) ... [2025-02-08 05:39:40,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e238e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:40, skipping insertion in model container [2025-02-08 05:39:40,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:38" (2/3) ... [2025-02-08 05:39:40,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e238e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:40, skipping insertion in model container [2025-02-08 05:39:40,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:40" (3/3) ... [2025-02-08 05:39:40,139 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2025-02-08 05:39:40,159 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:40,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt2.wvr.c that has 5 procedures, 405 locations, 1 initial locations, 6 loop locations, and 95 error locations. [2025-02-08 05:39:40,160 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:40,302 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:39:40,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 417 places, 419 transitions, 866 flow [2025-02-08 05:39:40,453 INFO L124 PetriNetUnfolderBase]: 15/415 cut-off events. [2025-02-08 05:39:40,459 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:39:40,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 415 events. 15/415 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 604 event pairs, 0 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 375. Up to 2 conditions per place. [2025-02-08 05:39:40,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 417 places, 419 transitions, 866 flow [2025-02-08 05:39:40,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 398 transitions, 820 flow [2025-02-08 05:39:40,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:40,489 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;@3488a467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:40,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 141 error locations. [2025-02-08 05:39:40,496 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:40,496 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-02-08 05:39:40,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:40,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:40,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:40,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:40,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash 432743125, now seen corresponding path program 1 times [2025-02-08 05:39:40,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:40,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-02-08 05:39:40,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:40,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:39:40,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:39:40,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:40,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-02-08 05:39:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45589607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:40,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:40,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087298625] [2025-02-08 05:39:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:40,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:40,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:40,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:40,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 419 [2025-02-08 05:39:40,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 398 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-02-08 05:39:40,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:40,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 419 [2025-02-08 05:39:40,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:40,979 INFO L124 PetriNetUnfolderBase]: 366/1113 cut-off events. [2025-02-08 05:39:40,979 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-02-08 05:39:40,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 1113 events. 366/1113 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5146 event pairs, 272 based on Foata normal form. 6/986 useless extension candidates. Maximal degree in co-relation 1363. Up to 526 conditions per place. [2025-02-08 05:39:40,984 INFO L140 encePairwiseOnDemand]: 354/419 looper letters, 21 selfloop transitions, 2 changer transitions 8/335 dead transitions. [2025-02-08 05:39:40,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 335 transitions, 744 flow [2025-02-08 05:39:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2025-02-08 05:39:40,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528241845664281 [2025-02-08 05:39:40,997 INFO L175 Difference]: Start difference. First operand has 397 places, 398 transitions, 820 flow. Second operand 3 states and 1072 transitions. [2025-02-08 05:39:40,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 335 transitions, 744 flow [2025-02-08 05:39:41,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 335 transitions, 728 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:39:41,010 INFO L231 Difference]: Finished difference. Result has 334 places, 327 transitions, 666 flow [2025-02-08 05:39:41,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=334, PETRI_TRANSITIONS=327} [2025-02-08 05:39:41,019 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -63 predicate places. [2025-02-08 05:39:41,019 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 327 transitions, 666 flow [2025-02-08 05:39:41,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-02-08 05:39:41,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:41,020 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] [2025-02-08 05:39:41,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:41,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:41,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1610655320, now seen corresponding path program 1 times [2025-02-08 05:39:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:41,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270642489] [2025-02-08 05:39:41,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:41,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:41,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:39:41,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:39:41,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:41,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:41,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:41,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270642489] [2025-02-08 05:39:41,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270642489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:41,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:41,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:41,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607424062] [2025-02-08 05:39:41,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:41,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:41,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:41,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:41,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 419 [2025-02-08 05:39:41,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 327 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-02-08 05:39:41,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 419 [2025-02-08 05:39:41,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:41,324 INFO L124 PetriNetUnfolderBase]: 174/751 cut-off events. [2025-02-08 05:39:41,324 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:41,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 751 events. 174/751 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2689 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 1007. Up to 259 conditions per place. [2025-02-08 05:39:41,328 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 21 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2025-02-08 05:39:41,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 326 transitions, 710 flow [2025-02-08 05:39:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1008 transitions. [2025-02-08 05:39:41,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.801909307875895 [2025-02-08 05:39:41,331 INFO L175 Difference]: Start difference. First operand has 334 places, 327 transitions, 666 flow. Second operand 3 states and 1008 transitions. [2025-02-08 05:39:41,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 326 transitions, 710 flow [2025-02-08 05:39:41,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 326 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:41,336 INFO L231 Difference]: Finished difference. Result has 325 places, 326 transitions, 664 flow [2025-02-08 05:39:41,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=325, PETRI_TRANSITIONS=326} [2025-02-08 05:39:41,337 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -72 predicate places. [2025-02-08 05:39:41,337 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 664 flow [2025-02-08 05:39:41,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-02-08 05:39:41,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:41,338 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] [2025-02-08 05:39:41,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:41,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:41,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1286406761, now seen corresponding path program 1 times [2025-02-08 05:39:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:41,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940187651] [2025-02-08 05:39:41,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:41,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:39:41,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:39:41,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:41,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:41,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:41,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940187651] [2025-02-08 05:39:41,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940187651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:41,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:41,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122895622] [2025-02-08 05:39:41,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:41,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:41,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:41,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:41,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 419 [2025-02-08 05:39:41,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 326 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:41,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 419 [2025-02-08 05:39:41,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:41,573 INFO L124 PetriNetUnfolderBase]: 174/750 cut-off events. [2025-02-08 05:39:41,573 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:41,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 750 events. 174/750 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2687 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 997. Up to 258 conditions per place. [2025-02-08 05:39:41,578 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 20 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2025-02-08 05:39:41,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 325 transitions, 706 flow [2025-02-08 05:39:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-02-08 05:39:41,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8035003977724742 [2025-02-08 05:39:41,581 INFO L175 Difference]: Start difference. First operand has 325 places, 326 transitions, 664 flow. Second operand 3 states and 1010 transitions. [2025-02-08 05:39:41,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 325 transitions, 706 flow [2025-02-08 05:39:41,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 325 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:41,586 INFO L231 Difference]: Finished difference. Result has 324 places, 325 transitions, 662 flow [2025-02-08 05:39:41,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=324, PETRI_TRANSITIONS=325} [2025-02-08 05:39:41,587 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -73 predicate places. [2025-02-08 05:39:41,587 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 325 transitions, 662 flow [2025-02-08 05:39:41,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:41,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:41,588 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] [2025-02-08 05:39:41,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:41,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:41,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash -62223973, now seen corresponding path program 1 times [2025-02-08 05:39:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326800387] [2025-02-08 05:39:41,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:41,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:39:41,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:39:41,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:41,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:41,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:41,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326800387] [2025-02-08 05:39:41,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326800387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:41,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:41,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:41,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730163977] [2025-02-08 05:39:41,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:41,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:41,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:41,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 419 [2025-02-08 05:39:41,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 325 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:41,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 419 [2025-02-08 05:39:41,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:41,786 INFO L124 PetriNetUnfolderBase]: 174/749 cut-off events. [2025-02-08 05:39:41,786 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:41,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 749 events. 174/749 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2691 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 988. Up to 258 conditions per place. [2025-02-08 05:39:41,790 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 20 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-02-08 05:39:41,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 324 transitions, 704 flow [2025-02-08 05:39:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-02-08 05:39:41,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8035003977724742 [2025-02-08 05:39:41,793 INFO L175 Difference]: Start difference. First operand has 324 places, 325 transitions, 662 flow. Second operand 3 states and 1010 transitions. [2025-02-08 05:39:41,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 324 transitions, 704 flow [2025-02-08 05:39:41,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 324 transitions, 700 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:41,798 INFO L231 Difference]: Finished difference. Result has 323 places, 324 transitions, 660 flow [2025-02-08 05:39:41,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=323, PETRI_TRANSITIONS=324} [2025-02-08 05:39:41,799 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -74 predicate places. [2025-02-08 05:39:41,799 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 324 transitions, 660 flow [2025-02-08 05:39:41,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:41,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:41,800 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] [2025-02-08 05:39:41,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:41,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:41,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1645255057, now seen corresponding path program 1 times [2025-02-08 05:39:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:41,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475556770] [2025-02-08 05:39:41,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:41,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:41,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:39:41,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:39:41,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:41,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:41,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:41,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475556770] [2025-02-08 05:39:41,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475556770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:41,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:41,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542128414] [2025-02-08 05:39:41,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:41,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:41,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:41,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:41,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 419 [2025-02-08 05:39:41,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 324 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:41,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:41,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 419 [2025-02-08 05:39:41,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,002 INFO L124 PetriNetUnfolderBase]: 174/748 cut-off events. [2025-02-08 05:39:42,003 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:42,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 748 events. 174/748 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2681 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 979. Up to 258 conditions per place. [2025-02-08 05:39:42,006 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 20 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-02-08 05:39:42,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 323 transitions, 702 flow [2025-02-08 05:39:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-02-08 05:39:42,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8035003977724742 [2025-02-08 05:39:42,008 INFO L175 Difference]: Start difference. First operand has 323 places, 324 transitions, 660 flow. Second operand 3 states and 1010 transitions. [2025-02-08 05:39:42,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 323 transitions, 702 flow [2025-02-08 05:39:42,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 323 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,012 INFO L231 Difference]: Finished difference. Result has 322 places, 323 transitions, 658 flow [2025-02-08 05:39:42,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=322, PETRI_TRANSITIONS=323} [2025-02-08 05:39:42,014 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -75 predicate places. [2025-02-08 05:39:42,015 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 323 transitions, 658 flow [2025-02-08 05:39:42,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:42,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,016 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] [2025-02-08 05:39:42,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:42,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2061367488, now seen corresponding path program 1 times [2025-02-08 05:39:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875116681] [2025-02-08 05:39:42,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:39:42,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:39:42,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875116681] [2025-02-08 05:39:42,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875116681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646846165] [2025-02-08 05:39:42,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 419 [2025-02-08 05:39:42,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 323 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:42,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 419 [2025-02-08 05:39:42,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,157 INFO L124 PetriNetUnfolderBase]: 174/747 cut-off events. [2025-02-08 05:39:42,157 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:42,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 747 events. 174/747 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2698 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 970. Up to 258 conditions per place. [2025-02-08 05:39:42,161 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 20 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-02-08 05:39:42,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 322 transitions, 700 flow [2025-02-08 05:39:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-02-08 05:39:42,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8035003977724742 [2025-02-08 05:39:42,163 INFO L175 Difference]: Start difference. First operand has 322 places, 323 transitions, 658 flow. Second operand 3 states and 1010 transitions. [2025-02-08 05:39:42,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 322 transitions, 700 flow [2025-02-08 05:39:42,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 322 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,167 INFO L231 Difference]: Finished difference. Result has 321 places, 322 transitions, 656 flow [2025-02-08 05:39:42,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=321, PETRI_TRANSITIONS=322} [2025-02-08 05:39:42,168 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -76 predicate places. [2025-02-08 05:39:42,168 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 322 transitions, 656 flow [2025-02-08 05:39:42,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:42,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,169 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] [2025-02-08 05:39:42,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:42,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 529390250, now seen corresponding path program 1 times [2025-02-08 05:39:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968382473] [2025-02-08 05:39:42,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:39:42,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:39:42,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:42,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968382473] [2025-02-08 05:39:42,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968382473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446256412] [2025-02-08 05:39:42,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 419 [2025-02-08 05:39:42,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 322 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:42,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 419 [2025-02-08 05:39:42,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,293 INFO L124 PetriNetUnfolderBase]: 174/746 cut-off events. [2025-02-08 05:39:42,293 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:42,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 746 events. 174/746 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2675 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 961. Up to 258 conditions per place. [2025-02-08 05:39:42,297 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 20 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-02-08 05:39:42,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 321 transitions, 698 flow [2025-02-08 05:39:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-02-08 05:39:42,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8035003977724742 [2025-02-08 05:39:42,299 INFO L175 Difference]: Start difference. First operand has 321 places, 322 transitions, 656 flow. Second operand 3 states and 1010 transitions. [2025-02-08 05:39:42,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 321 transitions, 698 flow [2025-02-08 05:39:42,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 321 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,303 INFO L231 Difference]: Finished difference. Result has 320 places, 321 transitions, 654 flow [2025-02-08 05:39:42,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=320, PETRI_TRANSITIONS=321} [2025-02-08 05:39:42,304 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -77 predicate places. [2025-02-08 05:39:42,304 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 321 transitions, 654 flow [2025-02-08 05:39:42,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:42,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,305 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] [2025-02-08 05:39:42,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:42,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash -142105104, now seen corresponding path program 1 times [2025-02-08 05:39:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888631471] [2025-02-08 05:39:42,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:39:42,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:39:42,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888631471] [2025-02-08 05:39:42,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888631471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748060747] [2025-02-08 05:39:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 419 [2025-02-08 05:39:42,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 321 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:42,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 419 [2025-02-08 05:39:42,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,432 INFO L124 PetriNetUnfolderBase]: 174/745 cut-off events. [2025-02-08 05:39:42,432 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:42,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 745 events. 174/745 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2674 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 952. Up to 258 conditions per place. [2025-02-08 05:39:42,436 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 20 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2025-02-08 05:39:42,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 696 flow [2025-02-08 05:39:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-02-08 05:39:42,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8035003977724742 [2025-02-08 05:39:42,438 INFO L175 Difference]: Start difference. First operand has 320 places, 321 transitions, 654 flow. Second operand 3 states and 1010 transitions. [2025-02-08 05:39:42,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 696 flow [2025-02-08 05:39:42,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 320 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,442 INFO L231 Difference]: Finished difference. Result has 319 places, 320 transitions, 652 flow [2025-02-08 05:39:42,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=319, PETRI_TRANSITIONS=320} [2025-02-08 05:39:42,443 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -78 predicate places. [2025-02-08 05:39:42,443 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 320 transitions, 652 flow [2025-02-08 05:39:42,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:42,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,444 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, 1, 1, 1] [2025-02-08 05:39:42,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:42,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1293816968, now seen corresponding path program 1 times [2025-02-08 05:39:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978765827] [2025-02-08 05:39:42,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:39:42,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:39:42,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978765827] [2025-02-08 05:39:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978765827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015304855] [2025-02-08 05:39:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 419 [2025-02-08 05:39:42,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 320 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:42,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 419 [2025-02-08 05:39:42,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,686 INFO L124 PetriNetUnfolderBase]: 174/744 cut-off events. [2025-02-08 05:39:42,686 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:42,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 744 events. 174/744 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2698 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 943. Up to 258 conditions per place. [2025-02-08 05:39:42,689 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 20 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2025-02-08 05:39:42,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 319 transitions, 694 flow [2025-02-08 05:39:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-02-08 05:39:42,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8035003977724742 [2025-02-08 05:39:42,691 INFO L175 Difference]: Start difference. First operand has 319 places, 320 transitions, 652 flow. Second operand 3 states and 1010 transitions. [2025-02-08 05:39:42,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 319 transitions, 694 flow [2025-02-08 05:39:42,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,694 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 650 flow [2025-02-08 05:39:42,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2025-02-08 05:39:42,695 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -79 predicate places. [2025-02-08 05:39:42,695 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 650 flow [2025-02-08 05:39:42,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-02-08 05:39:42,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,696 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:42,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:42,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1314070150, now seen corresponding path program 1 times [2025-02-08 05:39:42,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329577176] [2025-02-08 05:39:42,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:39:42,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:39:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:42,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329577176] [2025-02-08 05:39:42,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329577176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053482973] [2025-02-08 05:39:42,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 419 [2025-02-08 05:39:42,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:42,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 419 [2025-02-08 05:39:42,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:42,827 INFO L124 PetriNetUnfolderBase]: 174/743 cut-off events. [2025-02-08 05:39:42,827 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:42,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 743 events. 174/743 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2696 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 931. Up to 255 conditions per place. [2025-02-08 05:39:42,830 INFO L140 encePairwiseOnDemand]: 417/419 looper letters, 18 selfloop transitions, 1 changer transitions 0/318 dead transitions. [2025-02-08 05:39:42,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 318 transitions, 686 flow [2025-02-08 05:39:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2025-02-08 05:39:42,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8106603023070803 [2025-02-08 05:39:42,832 INFO L175 Difference]: Start difference. First operand has 318 places, 319 transitions, 650 flow. Second operand 3 states and 1019 transitions. [2025-02-08 05:39:42,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 318 transitions, 686 flow [2025-02-08 05:39:42,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:42,835 INFO L231 Difference]: Finished difference. Result has 317 places, 318 transitions, 646 flow [2025-02-08 05:39:42,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=317, PETRI_TRANSITIONS=318} [2025-02-08 05:39:42,836 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -80 predicate places. [2025-02-08 05:39:42,836 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 646 flow [2025-02-08 05:39:42,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:42,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:42,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:42,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:39:42,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:42,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:42,837 INFO L85 PathProgramCache]: Analyzing trace with hash 516505907, now seen corresponding path program 1 times [2025-02-08 05:39:42,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:42,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-02-08 05:39:42,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:42,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 05:39:42,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:39:42,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:42,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:42,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:42,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-02-08 05:39:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800942936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:42,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609944686] [2025-02-08 05:39:42,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:42,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:42,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:42,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:42,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 419 [2025-02-08 05:39:42,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-02-08 05:39:42,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:42,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 419 [2025-02-08 05:39:42,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:43,004 INFO L124 PetriNetUnfolderBase]: 174/742 cut-off events. [2025-02-08 05:39:43,004 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:43,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 742 events. 174/742 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2692 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 931. Up to 257 conditions per place. [2025-02-08 05:39:43,007 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 19 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2025-02-08 05:39:43,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 317 transitions, 686 flow [2025-02-08 05:39:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-02-08 05:39:43,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050914876690533 [2025-02-08 05:39:43,010 INFO L175 Difference]: Start difference. First operand has 317 places, 318 transitions, 646 flow. Second operand 3 states and 1012 transitions. [2025-02-08 05:39:43,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 317 transitions, 686 flow [2025-02-08 05:39:43,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 317 transitions, 685 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:43,015 INFO L231 Difference]: Finished difference. Result has 317 places, 317 transitions, 647 flow [2025-02-08 05:39:43,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=647, PETRI_PLACES=317, PETRI_TRANSITIONS=317} [2025-02-08 05:39:43,016 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -80 predicate places. [2025-02-08 05:39:43,016 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 317 transitions, 647 flow [2025-02-08 05:39:43,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-02-08 05:39:43,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:43,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:43,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:39:43,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:43,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash -226348217, now seen corresponding path program 1 times [2025-02-08 05:39:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721376303] [2025-02-08 05:39:43,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:43,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 05:39:43,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:39:43,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:43,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:43,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:43,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721376303] [2025-02-08 05:39:43,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721376303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:43,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:43,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848710829] [2025-02-08 05:39:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:43,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:43,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:43,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 419 [2025-02-08 05:39:43,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 317 transitions, 647 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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-02-08 05:39:43,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:43,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 419 [2025-02-08 05:39:43,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:43,708 INFO L124 PetriNetUnfolderBase]: 174/740 cut-off events. [2025-02-08 05:39:43,708 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:43,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 740 events. 174/740 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2672 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 953. Up to 270 conditions per place. [2025-02-08 05:39:43,716 INFO L140 encePairwiseOnDemand]: 407/419 looper letters, 32 selfloop transitions, 10 changer transitions 0/315 dead transitions. [2025-02-08 05:39:43,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 315 transitions, 727 flow [2025-02-08 05:39:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1898 transitions. [2025-02-08 05:39:43,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7549721559268099 [2025-02-08 05:39:43,719 INFO L175 Difference]: Start difference. First operand has 317 places, 317 transitions, 647 flow. Second operand 6 states and 1898 transitions. [2025-02-08 05:39:43,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 315 transitions, 727 flow [2025-02-08 05:39:43,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 315 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:43,731 INFO L231 Difference]: Finished difference. Result has 318 places, 315 transitions, 659 flow [2025-02-08 05:39:43,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=659, PETRI_PLACES=318, PETRI_TRANSITIONS=315} [2025-02-08 05:39:43,732 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -79 predicate places. [2025-02-08 05:39:43,732 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 315 transitions, 659 flow [2025-02-08 05:39:43,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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-02-08 05:39:43,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:43,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:43,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:39:43,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:43,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash 727440053, now seen corresponding path program 1 times [2025-02-08 05:39:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891360834] [2025-02-08 05:39:43,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:43,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:39:43,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:39:43,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:43,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:43,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:43,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891360834] [2025-02-08 05:39:43,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891360834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:43,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:43,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:43,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734252406] [2025-02-08 05:39:43,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:43,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:43,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:43,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:43,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 419 [2025-02-08 05:39:43,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 315 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:43,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:43,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 419 [2025-02-08 05:39:43,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:43,884 INFO L124 PetriNetUnfolderBase]: 174/739 cut-off events. [2025-02-08 05:39:43,884 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:43,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 739 events. 174/739 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2679 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 1007. Up to 255 conditions per place. [2025-02-08 05:39:43,887 INFO L140 encePairwiseOnDemand]: 417/419 looper letters, 18 selfloop transitions, 1 changer transitions 0/314 dead transitions. [2025-02-08 05:39:43,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 695 flow [2025-02-08 05:39:43,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2025-02-08 05:39:43,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8106603023070803 [2025-02-08 05:39:43,890 INFO L175 Difference]: Start difference. First operand has 318 places, 315 transitions, 659 flow. Second operand 3 states and 1019 transitions. [2025-02-08 05:39:43,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 695 flow [2025-02-08 05:39:43,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 314 transitions, 675 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:43,894 INFO L231 Difference]: Finished difference. Result has 314 places, 314 transitions, 639 flow [2025-02-08 05:39:43,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=314, PETRI_TRANSITIONS=314} [2025-02-08 05:39:43,895 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -83 predicate places. [2025-02-08 05:39:43,895 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 314 transitions, 639 flow [2025-02-08 05:39:43,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:43,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:43,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:43,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:39:43,896 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:43,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash 389661921, now seen corresponding path program 1 times [2025-02-08 05:39:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:43,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223057422] [2025-02-08 05:39:43,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:43,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:39:43,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:39:43,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:43,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223057422] [2025-02-08 05:39:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223057422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:43,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65155387] [2025-02-08 05:39:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:43,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:43,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:43,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:43,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:43,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 419 [2025-02-08 05:39:43,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 314 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-02-08 05:39:43,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:43,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 419 [2025-02-08 05:39:43,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,060 INFO L124 PetriNetUnfolderBase]: 174/738 cut-off events. [2025-02-08 05:39:44,060 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:44,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 738 events. 174/738 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2668 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 928. Up to 257 conditions per place. [2025-02-08 05:39:44,064 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 19 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2025-02-08 05:39:44,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 313 transitions, 679 flow [2025-02-08 05:39:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-02-08 05:39:44,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050914876690533 [2025-02-08 05:39:44,067 INFO L175 Difference]: Start difference. First operand has 314 places, 314 transitions, 639 flow. Second operand 3 states and 1012 transitions. [2025-02-08 05:39:44,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 313 transitions, 679 flow [2025-02-08 05:39:44,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 313 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:44,071 INFO L231 Difference]: Finished difference. Result has 314 places, 313 transitions, 640 flow [2025-02-08 05:39:44,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=314, PETRI_TRANSITIONS=313} [2025-02-08 05:39:44,072 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -83 predicate places. [2025-02-08 05:39:44,072 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 313 transitions, 640 flow [2025-02-08 05:39:44,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-02-08 05:39:44,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:44,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:39:44,073 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1412457979, now seen corresponding path program 1 times [2025-02-08 05:39:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133439678] [2025-02-08 05:39:44,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:39:44,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:39:44,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:44,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:44,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133439678] [2025-02-08 05:39:44,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133439678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:44,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:44,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:44,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056452047] [2025-02-08 05:39:44,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:44,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:44,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:44,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:44,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 419 [2025-02-08 05:39:44,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 313 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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-02-08 05:39:44,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 419 [2025-02-08 05:39:44,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,220 INFO L124 PetriNetUnfolderBase]: 174/736 cut-off events. [2025-02-08 05:39:44,220 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:44,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 736 events. 174/736 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2662 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 928. Up to 257 conditions per place. [2025-02-08 05:39:44,224 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 20 selfloop transitions, 1 changer transitions 0/311 dead transitions. [2025-02-08 05:39:44,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 311 transitions, 678 flow [2025-02-08 05:39:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1013 transitions. [2025-02-08 05:39:44,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8058870326173428 [2025-02-08 05:39:44,226 INFO L175 Difference]: Start difference. First operand has 314 places, 313 transitions, 640 flow. Second operand 3 states and 1013 transitions. [2025-02-08 05:39:44,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 311 transitions, 678 flow [2025-02-08 05:39:44,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 311 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:44,230 INFO L231 Difference]: Finished difference. Result has 312 places, 311 transitions, 634 flow [2025-02-08 05:39:44,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=312, PETRI_TRANSITIONS=311} [2025-02-08 05:39:44,231 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -85 predicate places. [2025-02-08 05:39:44,232 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 311 transitions, 634 flow [2025-02-08 05:39:44,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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-02-08 05:39:44,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:44,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:39:44,233 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,233 INFO L85 PathProgramCache]: Analyzing trace with hash -426713910, now seen corresponding path program 1 times [2025-02-08 05:39:44,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619346303] [2025-02-08 05:39:44,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 05:39:44,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 05:39:44,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619346303] [2025-02-08 05:39:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619346303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654303076] [2025-02-08 05:39:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:44,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:44,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:44,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 419 [2025-02-08 05:39:44,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 311 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:44,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 419 [2025-02-08 05:39:44,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,371 INFO L124 PetriNetUnfolderBase]: 174/735 cut-off events. [2025-02-08 05:39:44,372 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:44,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 735 events. 174/735 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2655 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 924. Up to 255 conditions per place. [2025-02-08 05:39:44,375 INFO L140 encePairwiseOnDemand]: 417/419 looper letters, 18 selfloop transitions, 1 changer transitions 0/310 dead transitions. [2025-02-08 05:39:44,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 310 transitions, 670 flow [2025-02-08 05:39:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2025-02-08 05:39:44,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8106603023070803 [2025-02-08 05:39:44,378 INFO L175 Difference]: Start difference. First operand has 312 places, 311 transitions, 634 flow. Second operand 3 states and 1019 transitions. [2025-02-08 05:39:44,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 310 transitions, 670 flow [2025-02-08 05:39:44,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 310 transitions, 669 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:44,382 INFO L231 Difference]: Finished difference. Result has 312 places, 310 transitions, 633 flow [2025-02-08 05:39:44,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=312, PETRI_TRANSITIONS=310} [2025-02-08 05:39:44,383 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -85 predicate places. [2025-02-08 05:39:44,383 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 310 transitions, 633 flow [2025-02-08 05:39:44,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:44,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:44,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:39:44,385 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2050134546, now seen corresponding path program 1 times [2025-02-08 05:39:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649529661] [2025-02-08 05:39:44,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:39:44,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:39:44,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:44,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649529661] [2025-02-08 05:39:44,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649529661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:44,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:44,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:44,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207947981] [2025-02-08 05:39:44,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:44,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:44,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:44,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:44,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 419 [2025-02-08 05:39:44,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 310 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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-02-08 05:39:44,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 419 [2025-02-08 05:39:44,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,532 INFO L124 PetriNetUnfolderBase]: 174/733 cut-off events. [2025-02-08 05:39:44,533 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:39:44,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 733 events. 174/733 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2654 event pairs, 121 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 925. Up to 257 conditions per place. [2025-02-08 05:39:44,536 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 20 selfloop transitions, 1 changer transitions 0/308 dead transitions. [2025-02-08 05:39:44,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 671 flow [2025-02-08 05:39:44,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1013 transitions. [2025-02-08 05:39:44,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8058870326173428 [2025-02-08 05:39:44,538 INFO L175 Difference]: Start difference. First operand has 312 places, 310 transitions, 633 flow. Second operand 3 states and 1013 transitions. [2025-02-08 05:39:44,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 671 flow [2025-02-08 05:39:44,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 308 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:44,541 INFO L231 Difference]: Finished difference. Result has 311 places, 308 transitions, 630 flow [2025-02-08 05:39:44,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=311, PETRI_TRANSITIONS=308} [2025-02-08 05:39:44,542 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -86 predicate places. [2025-02-08 05:39:44,542 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 308 transitions, 630 flow [2025-02-08 05:39:44,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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-02-08 05:39:44,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:44,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:39:44,542 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,543 INFO L85 PathProgramCache]: Analyzing trace with hash -251839147, now seen corresponding path program 1 times [2025-02-08 05:39:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001179330] [2025-02-08 05:39:44,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 05:39:44,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 05:39:44,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:44,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001179330] [2025-02-08 05:39:44,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001179330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:44,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:44,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:44,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033515440] [2025-02-08 05:39:44,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:44,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:44,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:44,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 419 [2025-02-08 05:39:44,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 308 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:44,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 419 [2025-02-08 05:39:44,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:44,752 INFO L124 PetriNetUnfolderBase]: 342/1235 cut-off events. [2025-02-08 05:39:44,753 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 05:39:44,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 1235 events. 342/1235 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6397 event pairs, 242 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1710. Up to 255 conditions per place. [2025-02-08 05:39:44,760 INFO L140 encePairwiseOnDemand]: 417/419 looper letters, 34 selfloop transitions, 1 changer transitions 0/323 dead transitions. [2025-02-08 05:39:44,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 323 transitions, 738 flow [2025-02-08 05:39:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1035 transitions. [2025-02-08 05:39:44,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8233890214797136 [2025-02-08 05:39:44,764 INFO L175 Difference]: Start difference. First operand has 311 places, 308 transitions, 630 flow. Second operand 3 states and 1035 transitions. [2025-02-08 05:39:44,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 323 transitions, 738 flow [2025-02-08 05:39:44,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 323 transitions, 737 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:44,769 INFO L231 Difference]: Finished difference. Result has 311 places, 307 transitions, 629 flow [2025-02-08 05:39:44,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=311, PETRI_TRANSITIONS=307} [2025-02-08 05:39:44,770 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -86 predicate places. [2025-02-08 05:39:44,770 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 307 transitions, 629 flow [2025-02-08 05:39:44,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:44,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:44,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:44,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:39:44,771 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:44,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1499205049, now seen corresponding path program 1 times [2025-02-08 05:39:44,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719238197] [2025-02-08 05:39:44,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:44,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 05:39:44,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 05:39:44,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:44,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:44,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:44,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719238197] [2025-02-08 05:39:44,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719238197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:44,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:44,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187517275] [2025-02-08 05:39:44,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:44,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:44,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:44,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:44,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:44,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 419 [2025-02-08 05:39:44,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 307 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:44,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:44,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 419 [2025-02-08 05:39:44,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:45,044 INFO L124 PetriNetUnfolderBase]: 417/1491 cut-off events. [2025-02-08 05:39:45,045 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-08 05:39:45,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2197 conditions, 1491 events. 417/1491 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8526 event pairs, 285 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 2093. Up to 461 conditions per place. [2025-02-08 05:39:45,049 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 32 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-02-08 05:39:45,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 321 transitions, 733 flow [2025-02-08 05:39:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1034 transitions. [2025-02-08 05:39:45,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.822593476531424 [2025-02-08 05:39:45,052 INFO L175 Difference]: Start difference. First operand has 311 places, 307 transitions, 629 flow. Second operand 3 states and 1034 transitions. [2025-02-08 05:39:45,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 321 transitions, 733 flow [2025-02-08 05:39:45,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 321 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:45,058 INFO L231 Difference]: Finished difference. Result has 312 places, 307 transitions, 636 flow [2025-02-08 05:39:45,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=312, PETRI_TRANSITIONS=307} [2025-02-08 05:39:45,059 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -85 predicate places. [2025-02-08 05:39:45,059 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 307 transitions, 636 flow [2025-02-08 05:39:45,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:45,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:45,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:45,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:39:45,060 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:45,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1508237445, now seen corresponding path program 1 times [2025-02-08 05:39:45,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:45,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667923929] [2025-02-08 05:39:45,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:45,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:45,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 05:39:45,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 05:39:45,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:45,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667923929] [2025-02-08 05:39:45,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667923929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:45,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398210509] [2025-02-08 05:39:45,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:45,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:45,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:45,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:45,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:45,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 419 [2025-02-08 05:39:45,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 307 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:45,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:45,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 419 [2025-02-08 05:39:45,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:45,427 INFO L124 PetriNetUnfolderBase]: 826/2678 cut-off events. [2025-02-08 05:39:45,428 INFO L125 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2025-02-08 05:39:45,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 2678 events. 826/2678 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 19533 event pairs, 612 based on Foata normal form. 0/2309 useless extension candidates. Maximal degree in co-relation 4153. Up to 626 conditions per place. [2025-02-08 05:39:45,442 INFO L140 encePairwiseOnDemand]: 417/419 looper letters, 36 selfloop transitions, 1 changer transitions 0/323 dead transitions. [2025-02-08 05:39:45,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 323 transitions, 755 flow [2025-02-08 05:39:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1035 transitions. [2025-02-08 05:39:45,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8233890214797136 [2025-02-08 05:39:45,445 INFO L175 Difference]: Start difference. First operand has 312 places, 307 transitions, 636 flow. Second operand 3 states and 1035 transitions. [2025-02-08 05:39:45,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 323 transitions, 755 flow [2025-02-08 05:39:45,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 323 transitions, 752 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:45,449 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 634 flow [2025-02-08 05:39:45,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-02-08 05:39:45,450 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -85 predicate places. [2025-02-08 05:39:45,450 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 634 flow [2025-02-08 05:39:45,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:45,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:45,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:45,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:39:45,450 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:45,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:45,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2012158750, now seen corresponding path program 1 times [2025-02-08 05:39:45,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:45,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532900048] [2025-02-08 05:39:45,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:45,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 05:39:45,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 05:39:45,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:45,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:45,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:45,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532900048] [2025-02-08 05:39:45,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532900048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:45,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:45,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99807857] [2025-02-08 05:39:45,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:45,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:45,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:45,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:45,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 419 [2025-02-08 05:39:45,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:45,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:45,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 419 [2025-02-08 05:39:45,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:45,875 INFO L124 PetriNetUnfolderBase]: 970/3258 cut-off events. [2025-02-08 05:39:45,875 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-02-08 05:39:45,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 3258 events. 970/3258 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 25715 event pairs, 683 based on Foata normal form. 0/2769 useless extension candidates. Maximal degree in co-relation 4959. Up to 1101 conditions per place. [2025-02-08 05:39:45,893 INFO L140 encePairwiseOnDemand]: 416/419 looper letters, 34 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-02-08 05:39:45,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 321 transitions, 748 flow [2025-02-08 05:39:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1034 transitions. [2025-02-08 05:39:45,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.822593476531424 [2025-02-08 05:39:45,895 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 634 flow. Second operand 3 states and 1034 transitions. [2025-02-08 05:39:45,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 321 transitions, 748 flow [2025-02-08 05:39:45,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 321 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:45,899 INFO L231 Difference]: Finished difference. Result has 313 places, 306 transitions, 641 flow [2025-02-08 05:39:45,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=313, PETRI_TRANSITIONS=306} [2025-02-08 05:39:45,900 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -84 predicate places. [2025-02-08 05:39:45,900 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 306 transitions, 641 flow [2025-02-08 05:39:45,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-02-08 05:39:45,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:45,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:39:45,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:39:45,901 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 137 more)] === [2025-02-08 05:39:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1713980445, now seen corresponding path program 1 times [2025-02-08 05:39:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924120934] [2025-02-08 05:39:45,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:45,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-08 05:39:45,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-08 05:39:45,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:45,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:45,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924120934] [2025-02-08 05:39:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924120934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:45,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:45,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024774755] [2025-02-08 05:39:45,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:45,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:45,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:45,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 419 [2025-02-08 05:39:45,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 306 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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-02-08 05:39:45,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:45,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 419 [2025-02-08 05:39:45,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:46,364 INFO L124 PetriNetUnfolderBase]: 970/3167 cut-off events. [2025-02-08 05:39:46,364 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2025-02-08 05:39:46,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5224 conditions, 3167 events. 970/3167 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 24709 event pairs, 742 based on Foata normal form. 9/2732 useless extension candidates. Maximal degree in co-relation 5119. Up to 1471 conditions per place. [2025-02-08 05:39:46,380 INFO L140 encePairwiseOnDemand]: 417/419 looper letters, 0 selfloop transitions, 0 changer transitions 305/305 dead transitions. [2025-02-08 05:39:46,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 305 transitions, 677 flow [2025-02-08 05:39:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1020 transitions. [2025-02-08 05:39:46,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8114558472553699 [2025-02-08 05:39:46,383 INFO L175 Difference]: Start difference. First operand has 313 places, 306 transitions, 641 flow. Second operand 3 states and 1020 transitions. [2025-02-08 05:39:46,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 305 transitions, 677 flow [2025-02-08 05:39:46,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 305 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:46,390 INFO L231 Difference]: Finished difference. Result has 313 places, 0 transitions, 0 flow [2025-02-08 05:39:46,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=313, PETRI_TRANSITIONS=0} [2025-02-08 05:39:46,394 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -84 predicate places. [2025-02-08 05:39:46,394 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 0 transitions, 0 flow [2025-02-08 05:39:46,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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-02-08 05:39:46,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (140 of 141 remaining) [2025-02-08 05:39:46,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (139 of 141 remaining) [2025-02-08 05:39:46,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (138 of 141 remaining) [2025-02-08 05:39:46,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (137 of 141 remaining) [2025-02-08 05:39:46,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (136 of 141 remaining) [2025-02-08 05:39:46,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (135 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (134 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (133 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (132 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (131 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (130 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (129 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (128 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (127 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (126 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (125 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (124 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (123 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (122 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (121 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (120 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (119 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (118 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (117 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (116 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (115 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (114 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (113 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (112 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (111 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (110 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (109 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (108 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (107 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (106 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (105 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (104 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (103 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (102 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (101 of 141 remaining) [2025-02-08 05:39:46,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (100 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (99 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (98 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (97 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (96 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (95 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (94 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (93 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (92 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (91 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (90 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (89 of 141 remaining) [2025-02-08 05:39:46,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (88 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (87 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (86 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (85 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (84 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (83 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (82 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (81 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (79 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (78 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (77 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 141 remaining) [2025-02-08 05:39:46,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (75 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (74 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (73 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (70 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (69 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (68 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (67 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (66 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (65 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (64 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (63 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (62 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (61 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (60 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (59 of 141 remaining) [2025-02-08 05:39:46,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (58 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (57 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (56 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (54 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (53 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (52 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (51 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (47 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 141 remaining) [2025-02-08 05:39:46,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (39 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (38 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (37 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (36 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (35 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (31 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 141 remaining) [2025-02-08 05:39:46,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (27 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (25 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (24 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (23 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (22 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (21 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (20 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (19 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (18 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (17 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (16 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (15 of 141 remaining) [2025-02-08 05:39:46,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (14 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (13 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (12 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (11 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (10 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (9 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (8 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (7 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (5 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (4 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (3 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (2 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (1 of 141 remaining) [2025-02-08 05:39:46,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (0 of 141 remaining) [2025-02-08 05:39:46,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:39:46,409 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:46,413 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:46,413 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:46,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:46 BasicIcfg [2025-02-08 05:39:46,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:46,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:46,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:46,418 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:46,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:40" (3/4) ... [2025-02-08 05:39:46,420 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:46,422 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:46,422 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:46,422 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:39:46,422 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:39:46,427 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-02-08 05:39:46,427 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:46,427 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:39:46,428 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:46,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:46,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:46,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:46,512 INFO L158 Benchmark]: Toolchain (without parser) took 7811.30ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 106.8MB in the beginning and 277.6MB in the end (delta: -170.8MB). Peak memory consumption was 329.2MB. Max. memory is 16.1GB. [2025-02-08 05:39:46,512 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 167.8MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:46,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.72ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 92.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:46,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.56ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:46,512 INFO L158 Benchmark]: Boogie Preprocessor took 25.00ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 85.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:46,512 INFO L158 Benchmark]: IcfgBuilder took 1140.73ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 101.3MB in the end (delta: -15.6MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-02-08 05:39:46,512 INFO L158 Benchmark]: TraceAbstraction took 6283.30ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 101.3MB in the beginning and 286.0MB in the end (delta: -184.7MB). Peak memory consumption was 321.9MB. Max. memory is 16.1GB. [2025-02-08 05:39:46,513 INFO L158 Benchmark]: Witness Printer took 93.17ms. Allocated memory is still 645.9MB. Free memory was 286.0MB in the beginning and 277.6MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:46,513 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 167.8MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.72ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 92.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.56ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.00ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 85.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1140.73ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 101.3MB in the end (delta: -15.6MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6283.30ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 101.3MB in the beginning and 286.0MB in the end (delta: -184.7MB). Peak memory consumption was 321.9MB. Max. memory is 16.1GB. * Witness Printer took 93.17ms. Allocated memory is still 645.9MB. Free memory was 286.0MB in the beginning and 277.6MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 497 locations, 141 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 429 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1037 IncrementalHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 84 mSDtfsCounter, 1037 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=820occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2754 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2732 ConstructedInterpolants, 0 QuantifiedInterpolants, 2889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 95 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:46,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE