./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:38:22,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:38:22,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:38:22,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:38:22,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:38:22,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:38:22,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:38:22,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:38:22,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:38:22,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:38:22,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:38:22,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:38:22,817 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:38:22,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:38:22,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:38:22,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:38:22,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:38:22,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:38:22,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:38:22,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:38:22,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:38:22,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:38:22,822 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:38:22,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:38:22,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:38:22,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:38:22,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:38:22,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:38:22,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:38:22,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:38:22,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:38:22,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:38:22,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:38:22,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:38:22,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:38:22,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:38:22,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:38:22,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:38:22,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:38:22,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:38:22,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:38:22,825 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 [2024-11-10 14:38:23,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:38:23,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:38:23,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:38:23,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:38:23,046 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:38:23,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2024-11-10 14:38:24,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:38:24,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:38:24,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2024-11-10 14:38:24,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15725336/e23d5c584e7e41468ca5d769f82994d4/FLAGe3d2ce881 [2024-11-10 14:38:24,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15725336/e23d5c584e7e41468ca5d769f82994d4 [2024-11-10 14:38:24,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:38:24,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:38:24,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:38:24,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:38:24,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:38:24,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:38:24" (1/1) ... [2024-11-10 14:38:24,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6657a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:24, skipping insertion in model container [2024-11-10 14:38:24,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:38:24" (1/1) ... [2024-11-10 14:38:24,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:38:25,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:38:25,123 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:38:25,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:38:25,169 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:38:25,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25 WrapperNode [2024-11-10 14:38:25,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:38:25,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:38:25,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:38:25,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:38:25,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,221 INFO L138 Inliner]: procedures = 28, calls = 59, calls flagged for inlining = 23, calls inlined = 33, statements flattened = 631 [2024-11-10 14:38:25,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:38:25,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:38:25,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:38:25,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:38:25,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:38:25,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:38:25,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:38:25,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:38:25,267 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (1/1) ... [2024-11-10 14:38:25,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:38:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:38:25,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:38:25,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:38:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:38:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:38:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:38:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:38:25,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:38:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:38:25,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:38:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:38:25,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:38:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-10 14:38:25,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-10 14:38:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:38:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-10 14:38:25,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-10 14:38:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-10 14:38:25,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-10 14:38:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 14:38:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 14:38:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:38:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:38:25,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:38:25,356 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:38:25,479 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:38:25,481 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:38:26,122 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:38:26,122 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:38:26,500 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:38:26,502 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:38:26,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:38:26 BoogieIcfgContainer [2024-11-10 14:38:26,502 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:38:26,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:38:26,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:38:26,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:38:26,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:38:24" (1/3) ... [2024-11-10 14:38:26,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501e5eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:38:26, skipping insertion in model container [2024-11-10 14:38:26,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:25" (2/3) ... [2024-11-10 14:38:26,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501e5eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:38:26, skipping insertion in model container [2024-11-10 14:38:26,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:38:26" (3/3) ... [2024-11-10 14:38:26,511 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2024-11-10 14:38:26,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:38:26,526 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-11-10 14:38:26,526 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:38:26,634 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-10 14:38:26,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 514 places, 523 transitions, 1112 flow [2024-11-10 14:38:26,914 INFO L124 PetriNetUnfolderBase]: 26/473 cut-off events. [2024-11-10 14:38:26,914 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:38:26,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 473 events. 26/473 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 840 event pairs, 0 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 415. Up to 3 conditions per place. [2024-11-10 14:38:26,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 514 places, 523 transitions, 1112 flow [2024-11-10 14:38:26,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 450 places, 456 transitions, 960 flow [2024-11-10 14:38:26,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:38:26,951 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;@337a338b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:38:26,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2024-11-10 14:38:26,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:38:26,957 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-11-10 14:38:26,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:38:26,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:26,959 INFO L204 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] [2024-11-10 14:38:26,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash -103364801, now seen corresponding path program 1 times [2024-11-10 14:38:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:26,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951990198] [2024-11-10 14:38:26,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:27,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:27,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951990198] [2024-11-10 14:38:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951990198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:27,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583079642] [2024-11-10 14:38:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:27,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:27,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:27,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 527 [2024-11-10 14:38:27,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 456 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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) [2024-11-10 14:38:27,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:27,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 527 [2024-11-10 14:38:27,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:27,993 INFO L124 PetriNetUnfolderBase]: 1299/4038 cut-off events. [2024-11-10 14:38:27,993 INFO L125 PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES. [2024-11-10 14:38:28,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 4038 events. 1299/4038 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 30511 event pairs, 526 based on Foata normal form. 565/3832 useless extension candidates. Maximal degree in co-relation 6108. Up to 1640 conditions per place. [2024-11-10 14:38:28,032 INFO L140 encePairwiseOnDemand]: 463/527 looper letters, 31 selfloop transitions, 2 changer transitions 4/394 dead transitions. [2024-11-10 14:38:28,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 394 transitions, 902 flow [2024-11-10 14:38:28,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1325 transitions. [2024-11-10 14:38:28,053 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8380771663504112 [2024-11-10 14:38:28,055 INFO L175 Difference]: Start difference. First operand has 450 places, 456 transitions, 960 flow. Second operand 3 states and 1325 transitions. [2024-11-10 14:38:28,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 394 transitions, 902 flow [2024-11-10 14:38:28,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 394 transitions, 870 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-10 14:38:28,080 INFO L231 Difference]: Finished difference. Result has 389 places, 390 transitions, 800 flow [2024-11-10 14:38:28,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=389, PETRI_TRANSITIONS=390} [2024-11-10 14:38:28,085 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -61 predicate places. [2024-11-10 14:38:28,087 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 390 transitions, 800 flow [2024-11-10 14:38:28,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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) [2024-11-10 14:38:28,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:28,089 INFO L204 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] [2024-11-10 14:38:28,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:38:28,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:28,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:28,090 INFO L85 PathProgramCache]: Analyzing trace with hash 271389411, now seen corresponding path program 1 times [2024-11-10 14:38:28,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:28,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082673796] [2024-11-10 14:38:28,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:28,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082673796] [2024-11-10 14:38:28,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082673796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:28,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:28,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747854669] [2024-11-10 14:38:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:28,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:28,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:28,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:28,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:28,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 527 [2024-11-10 14:38:28,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 390 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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) [2024-11-10 14:38:28,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:28,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 527 [2024-11-10 14:38:28,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:28,708 INFO L124 PetriNetUnfolderBase]: 1292/3933 cut-off events. [2024-11-10 14:38:28,709 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2024-11-10 14:38:28,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 3933 events. 1292/3933 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 29230 event pairs, 521 based on Foata normal form. 0/3190 useless extension candidates. Maximal degree in co-relation 5682. Up to 1631 conditions per place. [2024-11-10 14:38:28,737 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 31 selfloop transitions, 2 changer transitions 0/389 dead transitions. [2024-11-10 14:38:28,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 389 transitions, 864 flow [2024-11-10 14:38:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:28,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2024-11-10 14:38:28,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.799493991144845 [2024-11-10 14:38:28,740 INFO L175 Difference]: Start difference. First operand has 389 places, 390 transitions, 800 flow. Second operand 3 states and 1264 transitions. [2024-11-10 14:38:28,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 389 transitions, 864 flow [2024-11-10 14:38:28,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 389 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:28,745 INFO L231 Difference]: Finished difference. Result has 384 places, 389 transitions, 798 flow [2024-11-10 14:38:28,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=384, PETRI_TRANSITIONS=389} [2024-11-10 14:38:28,747 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -66 predicate places. [2024-11-10 14:38:28,748 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 389 transitions, 798 flow [2024-11-10 14:38:28,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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) [2024-11-10 14:38:28,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:28,749 INFO L204 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] [2024-11-10 14:38:28,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:38:28,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:28,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:28,750 INFO L85 PathProgramCache]: Analyzing trace with hash -478593017, now seen corresponding path program 1 times [2024-11-10 14:38:28,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:28,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462926836] [2024-11-10 14:38:28,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:28,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462926836] [2024-11-10 14:38:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462926836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:28,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612273092] [2024-11-10 14:38:28,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:28,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:28,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:28,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:28,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-10 14:38:28,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 389 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:28,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:28,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-10 14:38:28,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:29,394 INFO L124 PetriNetUnfolderBase]: 1245/3790 cut-off events. [2024-11-10 14:38:29,395 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:29,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 3790 events. 1245/3790 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27817 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5459. Up to 1563 conditions per place. [2024-11-10 14:38:29,428 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2024-11-10 14:38:29,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 388 transitions, 858 flow [2024-11-10 14:38:29,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-10 14:38:29,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-10 14:38:29,432 INFO L175 Difference]: Start difference. First operand has 384 places, 389 transitions, 798 flow. Second operand 3 states and 1271 transitions. [2024-11-10 14:38:29,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 388 transitions, 858 flow [2024-11-10 14:38:29,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 388 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:29,438 INFO L231 Difference]: Finished difference. Result has 383 places, 388 transitions, 796 flow [2024-11-10 14:38:29,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=383, PETRI_TRANSITIONS=388} [2024-11-10 14:38:29,439 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -67 predicate places. [2024-11-10 14:38:29,439 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 388 transitions, 796 flow [2024-11-10 14:38:29,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:29,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:29,440 INFO L204 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] [2024-11-10 14:38:29,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:38:29,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:29,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1574589805, now seen corresponding path program 1 times [2024-11-10 14:38:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:29,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940452004] [2024-11-10 14:38:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940452004] [2024-11-10 14:38:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940452004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:29,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:29,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233360823] [2024-11-10 14:38:29,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:29,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:29,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:29,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-10 14:38:29,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 388 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:29,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:29,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-10 14:38:29,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:29,938 INFO L124 PetriNetUnfolderBase]: 1245/3789 cut-off events. [2024-11-10 14:38:29,938 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:29,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5504 conditions, 3789 events. 1245/3789 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27848 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5450. Up to 1563 conditions per place. [2024-11-10 14:38:29,968 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2024-11-10 14:38:29,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 387 transitions, 856 flow [2024-11-10 14:38:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-10 14:38:29,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-10 14:38:29,971 INFO L175 Difference]: Start difference. First operand has 383 places, 388 transitions, 796 flow. Second operand 3 states and 1271 transitions. [2024-11-10 14:38:29,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 387 transitions, 856 flow [2024-11-10 14:38:29,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 387 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:29,976 INFO L231 Difference]: Finished difference. Result has 382 places, 387 transitions, 794 flow [2024-11-10 14:38:29,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=382, PETRI_TRANSITIONS=387} [2024-11-10 14:38:29,977 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -68 predicate places. [2024-11-10 14:38:29,978 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 387 transitions, 794 flow [2024-11-10 14:38:29,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:29,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:29,979 INFO L204 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] [2024-11-10 14:38:29,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:38:29,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:29,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1130373257, now seen corresponding path program 1 times [2024-11-10 14:38:29,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:29,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404145385] [2024-11-10 14:38:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:30,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:30,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404145385] [2024-11-10 14:38:30,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404145385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:30,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:30,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:30,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042989910] [2024-11-10 14:38:30,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:30,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:30,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:30,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:30,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-10 14:38:30,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 387 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:30,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:30,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-10 14:38:30,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:30,434 INFO L124 PetriNetUnfolderBase]: 1245/3788 cut-off events. [2024-11-10 14:38:30,434 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:30,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5503 conditions, 3788 events. 1245/3788 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27811 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5441. Up to 1563 conditions per place. [2024-11-10 14:38:30,464 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2024-11-10 14:38:30,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 386 transitions, 854 flow [2024-11-10 14:38:30,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-10 14:38:30,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-10 14:38:30,467 INFO L175 Difference]: Start difference. First operand has 382 places, 387 transitions, 794 flow. Second operand 3 states and 1271 transitions. [2024-11-10 14:38:30,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 386 transitions, 854 flow [2024-11-10 14:38:30,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 386 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:30,471 INFO L231 Difference]: Finished difference. Result has 381 places, 386 transitions, 792 flow [2024-11-10 14:38:30,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=381, PETRI_TRANSITIONS=386} [2024-11-10 14:38:30,472 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -69 predicate places. [2024-11-10 14:38:30,473 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 386 transitions, 792 flow [2024-11-10 14:38:30,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:30,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:30,474 INFO L204 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] [2024-11-10 14:38:30,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:38:30,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:30,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash 242785853, now seen corresponding path program 1 times [2024-11-10 14:38:30,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:30,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266907703] [2024-11-10 14:38:30,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:30,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266907703] [2024-11-10 14:38:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266907703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:30,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594393812] [2024-11-10 14:38:30,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:30,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:30,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:30,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-10 14:38:30,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 386 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:30,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:30,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-10 14:38:30,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:30,924 INFO L124 PetriNetUnfolderBase]: 1245/3787 cut-off events. [2024-11-10 14:38:30,924 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:30,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 3787 events. 1245/3787 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27742 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5432. Up to 1563 conditions per place. [2024-11-10 14:38:30,954 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-11-10 14:38:30,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 385 transitions, 852 flow [2024-11-10 14:38:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-10 14:38:30,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-10 14:38:30,957 INFO L175 Difference]: Start difference. First operand has 381 places, 386 transitions, 792 flow. Second operand 3 states and 1271 transitions. [2024-11-10 14:38:30,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 385 transitions, 852 flow [2024-11-10 14:38:30,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 385 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:30,961 INFO L231 Difference]: Finished difference. Result has 380 places, 385 transitions, 790 flow [2024-11-10 14:38:30,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=380, PETRI_TRANSITIONS=385} [2024-11-10 14:38:30,963 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -70 predicate places. [2024-11-10 14:38:30,963 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 385 transitions, 790 flow [2024-11-10 14:38:30,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:30,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:30,964 INFO L204 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] [2024-11-10 14:38:30,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:38:30,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:30,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash 512056188, now seen corresponding path program 1 times [2024-11-10 14:38:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:30,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100055723] [2024-11-10 14:38:30,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:30,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100055723] [2024-11-10 14:38:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100055723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:30,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:30,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688392482] [2024-11-10 14:38:30,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:30,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:30,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:31,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 527 [2024-11-10 14:38:31,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 385 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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) [2024-11-10 14:38:31,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:31,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 527 [2024-11-10 14:38:31,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:31,506 INFO L124 PetriNetUnfolderBase]: 1245/3786 cut-off events. [2024-11-10 14:38:31,507 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:31,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5507 conditions, 3786 events. 1245/3786 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27788 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5429. Up to 1569 conditions per place. [2024-11-10 14:38:31,540 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 35 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2024-11-10 14:38:31,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 384 transitions, 862 flow [2024-11-10 14:38:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-11-10 14:38:31,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7963314358001266 [2024-11-10 14:38:31,543 INFO L175 Difference]: Start difference. First operand has 380 places, 385 transitions, 790 flow. Second operand 3 states and 1259 transitions. [2024-11-10 14:38:31,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 384 transitions, 862 flow [2024-11-10 14:38:31,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 384 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:31,548 INFO L231 Difference]: Finished difference. Result has 379 places, 384 transitions, 788 flow [2024-11-10 14:38:31,548 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=379, PETRI_TRANSITIONS=384} [2024-11-10 14:38:31,549 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -71 predicate places. [2024-11-10 14:38:31,549 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 384 transitions, 788 flow [2024-11-10 14:38:31,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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) [2024-11-10 14:38:31,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:31,550 INFO L204 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] [2024-11-10 14:38:31,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:38:31,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:31,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:31,551 INFO L85 PathProgramCache]: Analyzing trace with hash 544105443, now seen corresponding path program 1 times [2024-11-10 14:38:31,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:31,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944059150] [2024-11-10 14:38:31,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:31,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944059150] [2024-11-10 14:38:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944059150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:31,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:31,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706676509] [2024-11-10 14:38:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:31,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:31,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 527 [2024-11-10 14:38:31,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 384 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2024-11-10 14:38:31,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:31,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 527 [2024-11-10 14:38:31,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:32,011 INFO L124 PetriNetUnfolderBase]: 1245/3785 cut-off events. [2024-11-10 14:38:32,011 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:32,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5501 conditions, 3785 events. 1245/3785 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27755 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5415. Up to 1564 conditions per place. [2024-11-10 14:38:32,039 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 30 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-11-10 14:38:32,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 383 transitions, 850 flow [2024-11-10 14:38:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-10 14:38:32,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8026565464895635 [2024-11-10 14:38:32,041 INFO L175 Difference]: Start difference. First operand has 379 places, 384 transitions, 788 flow. Second operand 3 states and 1269 transitions. [2024-11-10 14:38:32,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 383 transitions, 850 flow [2024-11-10 14:38:32,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 383 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:32,048 INFO L231 Difference]: Finished difference. Result has 378 places, 383 transitions, 786 flow [2024-11-10 14:38:32,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=378, PETRI_TRANSITIONS=383} [2024-11-10 14:38:32,051 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -72 predicate places. [2024-11-10 14:38:32,051 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 383 transitions, 786 flow [2024-11-10 14:38:32,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2024-11-10 14:38:32,052 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:32,052 INFO L204 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] [2024-11-10 14:38:32,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:38:32,054 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:32,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:32,054 INFO L85 PathProgramCache]: Analyzing trace with hash -85905852, now seen corresponding path program 1 times [2024-11-10 14:38:32,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:32,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774686637] [2024-11-10 14:38:32,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:32,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:32,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:32,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774686637] [2024-11-10 14:38:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774686637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:32,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:32,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:32,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140634067] [2024-11-10 14:38:32,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:32,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:32,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:32,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:32,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 527 [2024-11-10 14:38:32,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 383 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2024-11-10 14:38:32,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:32,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 527 [2024-11-10 14:38:32,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:32,553 INFO L124 PetriNetUnfolderBase]: 1245/3784 cut-off events. [2024-11-10 14:38:32,553 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:32,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5500 conditions, 3784 events. 1245/3784 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27735 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5406. Up to 1564 conditions per place. [2024-11-10 14:38:32,574 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 30 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2024-11-10 14:38:32,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 382 transitions, 848 flow [2024-11-10 14:38:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-10 14:38:32,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8026565464895635 [2024-11-10 14:38:32,577 INFO L175 Difference]: Start difference. First operand has 378 places, 383 transitions, 786 flow. Second operand 3 states and 1269 transitions. [2024-11-10 14:38:32,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 382 transitions, 848 flow [2024-11-10 14:38:32,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 382 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:32,581 INFO L231 Difference]: Finished difference. Result has 377 places, 382 transitions, 784 flow [2024-11-10 14:38:32,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=377, PETRI_TRANSITIONS=382} [2024-11-10 14:38:32,583 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -73 predicate places. [2024-11-10 14:38:32,583 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 382 transitions, 784 flow [2024-11-10 14:38:32,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2024-11-10 14:38:32,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:32,584 INFO L204 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] [2024-11-10 14:38:32,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:38:32,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:32,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash -459527863, now seen corresponding path program 1 times [2024-11-10 14:38:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:32,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895951617] [2024-11-10 14:38:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:32,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895951617] [2024-11-10 14:38:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895951617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:32,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:32,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:32,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052234779] [2024-11-10 14:38:32,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:32,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:32,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:32,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:32,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 527 [2024-11-10 14:38:32,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 382 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2024-11-10 14:38:32,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:32,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 527 [2024-11-10 14:38:32,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:33,016 INFO L124 PetriNetUnfolderBase]: 1245/3783 cut-off events. [2024-11-10 14:38:33,016 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:33,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 3783 events. 1245/3783 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27766 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5397. Up to 1564 conditions per place. [2024-11-10 14:38:33,032 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 30 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2024-11-10 14:38:33,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 381 transitions, 846 flow [2024-11-10 14:38:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-10 14:38:33,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8026565464895635 [2024-11-10 14:38:33,035 INFO L175 Difference]: Start difference. First operand has 377 places, 382 transitions, 784 flow. Second operand 3 states and 1269 transitions. [2024-11-10 14:38:33,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 381 transitions, 846 flow [2024-11-10 14:38:33,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 381 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:33,039 INFO L231 Difference]: Finished difference. Result has 376 places, 381 transitions, 782 flow [2024-11-10 14:38:33,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=376, PETRI_TRANSITIONS=381} [2024-11-10 14:38:33,040 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -74 predicate places. [2024-11-10 14:38:33,040 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 381 transitions, 782 flow [2024-11-10 14:38:33,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2024-11-10 14:38:33,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:33,041 INFO L204 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] [2024-11-10 14:38:33,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:38:33,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:33,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:33,042 INFO L85 PathProgramCache]: Analyzing trace with hash 140500231, now seen corresponding path program 1 times [2024-11-10 14:38:33,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:33,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100159807] [2024-11-10 14:38:33,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:33,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:33,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100159807] [2024-11-10 14:38:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100159807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:33,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:33,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844340098] [2024-11-10 14:38:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:33,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:33,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 527 [2024-11-10 14:38:33,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 381 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2024-11-10 14:38:33,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:33,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 527 [2024-11-10 14:38:33,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:33,483 INFO L124 PetriNetUnfolderBase]: 1245/3782 cut-off events. [2024-11-10 14:38:33,483 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:33,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5498 conditions, 3782 events. 1245/3782 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27774 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5388. Up to 1564 conditions per place. [2024-11-10 14:38:33,553 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 30 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2024-11-10 14:38:33,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 380 transitions, 844 flow [2024-11-10 14:38:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-10 14:38:33,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8026565464895635 [2024-11-10 14:38:33,559 INFO L175 Difference]: Start difference. First operand has 376 places, 381 transitions, 782 flow. Second operand 3 states and 1269 transitions. [2024-11-10 14:38:33,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 380 transitions, 844 flow [2024-11-10 14:38:33,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 380 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:33,565 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 780 flow [2024-11-10 14:38:33,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2024-11-10 14:38:33,566 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -75 predicate places. [2024-11-10 14:38:33,566 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 780 flow [2024-11-10 14:38:33,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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) [2024-11-10 14:38:33,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:33,567 INFO L204 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] [2024-11-10 14:38:33,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:38:33,567 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash 163570734, now seen corresponding path program 1 times [2024-11-10 14:38:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:33,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823439441] [2024-11-10 14:38:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:33,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:33,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:33,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823439441] [2024-11-10 14:38:33,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823439441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:33,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:33,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:33,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136022094] [2024-11-10 14:38:33,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:33,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:33,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:33,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:33,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:33,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 527 [2024-11-10 14:38:33,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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) [2024-11-10 14:38:33,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:33,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 527 [2024-11-10 14:38:33,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:34,209 INFO L124 PetriNetUnfolderBase]: 1328/4039 cut-off events. [2024-11-10 14:38:34,209 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2024-11-10 14:38:34,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5882 conditions, 4039 events. 1328/4039 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 30382 event pairs, 536 based on Foata normal form. 0/3303 useless extension candidates. Maximal degree in co-relation 5764. Up to 1683 conditions per place. [2024-11-10 14:38:34,241 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 33 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2024-11-10 14:38:34,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 379 transitions, 848 flow [2024-11-10 14:38:34,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2024-11-10 14:38:34,245 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7950664136622391 [2024-11-10 14:38:34,245 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 780 flow. Second operand 3 states and 1257 transitions. [2024-11-10 14:38:34,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 379 transitions, 848 flow [2024-11-10 14:38:34,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:34,251 INFO L231 Difference]: Finished difference. Result has 374 places, 379 transitions, 778 flow [2024-11-10 14:38:34,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=374, PETRI_TRANSITIONS=379} [2024-11-10 14:38:34,252 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -76 predicate places. [2024-11-10 14:38:34,252 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 379 transitions, 778 flow [2024-11-10 14:38:34,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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) [2024-11-10 14:38:34,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:34,254 INFO L204 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] [2024-11-10 14:38:34,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:38:34,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:34,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1536988029, now seen corresponding path program 1 times [2024-11-10 14:38:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084383838] [2024-11-10 14:38:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:34,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084383838] [2024-11-10 14:38:34,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084383838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:34,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:34,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:34,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679471444] [2024-11-10 14:38:34,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:34,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:34,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:34,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:34,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 527 [2024-11-10 14:38:34,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 379 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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) [2024-11-10 14:38:34,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:34,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 527 [2024-11-10 14:38:34,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:34,778 INFO L124 PetriNetUnfolderBase]: 1432/4326 cut-off events. [2024-11-10 14:38:34,779 INFO L125 PetriNetUnfolderBase]: For 326/326 co-relation queries the response was YES. [2024-11-10 14:38:34,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6326 conditions, 4326 events. 1432/4326 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 33001 event pairs, 600 based on Foata normal form. 0/3548 useless extension candidates. Maximal degree in co-relation 6200. Up to 1830 conditions per place. [2024-11-10 14:38:34,797 INFO L140 encePairwiseOnDemand]: 522/527 looper letters, 34 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2024-11-10 14:38:34,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 375 transitions, 840 flow [2024-11-10 14:38:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-10 14:38:34,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7855787476280834 [2024-11-10 14:38:34,800 INFO L175 Difference]: Start difference. First operand has 374 places, 379 transitions, 778 flow. Second operand 3 states and 1242 transitions. [2024-11-10 14:38:34,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 375 transitions, 840 flow [2024-11-10 14:38:34,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 375 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:34,804 INFO L231 Difference]: Finished difference. Result has 370 places, 375 transitions, 768 flow [2024-11-10 14:38:34,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=370, PETRI_TRANSITIONS=375} [2024-11-10 14:38:34,805 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -80 predicate places. [2024-11-10 14:38:34,805 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 375 transitions, 768 flow [2024-11-10 14:38:34,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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) [2024-11-10 14:38:34,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:34,806 INFO L204 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] [2024-11-10 14:38:34,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:38:34,806 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:34,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:34,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1979995823, now seen corresponding path program 1 times [2024-11-10 14:38:34,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:34,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850428134] [2024-11-10 14:38:34,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:35,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:35,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850428134] [2024-11-10 14:38:35,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850428134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:35,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:35,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:35,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756344658] [2024-11-10 14:38:35,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:35,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:35,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:35,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:35,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:35,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 527 [2024-11-10 14:38:35,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 375 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 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) [2024-11-10 14:38:35,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:35,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 527 [2024-11-10 14:38:35,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:35,814 INFO L124 PetriNetUnfolderBase]: 1245/3769 cut-off events. [2024-11-10 14:38:35,815 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:35,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5491 conditions, 3769 events. 1245/3769 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27606 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5366. Up to 1568 conditions per place. [2024-11-10 14:38:35,829 INFO L140 encePairwiseOnDemand]: 521/527 looper letters, 34 selfloop transitions, 5 changer transitions 0/374 dead transitions. [2024-11-10 14:38:35,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 374 transitions, 844 flow [2024-11-10 14:38:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2476 transitions. [2024-11-10 14:38:35,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7830487033523087 [2024-11-10 14:38:35,833 INFO L175 Difference]: Start difference. First operand has 370 places, 375 transitions, 768 flow. Second operand 6 states and 2476 transitions. [2024-11-10 14:38:35,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 374 transitions, 844 flow [2024-11-10 14:38:35,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 374 transitions, 843 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:38:35,837 INFO L231 Difference]: Finished difference. Result has 373 places, 374 transitions, 775 flow [2024-11-10 14:38:35,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=775, PETRI_PLACES=373, PETRI_TRANSITIONS=374} [2024-11-10 14:38:35,838 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -77 predicate places. [2024-11-10 14:38:35,838 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 374 transitions, 775 flow [2024-11-10 14:38:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 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) [2024-11-10 14:38:35,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:35,840 INFO L204 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] [2024-11-10 14:38:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:38:35,840 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:35,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash 365119816, now seen corresponding path program 1 times [2024-11-10 14:38:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:35,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126702523] [2024-11-10 14:38:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:35,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126702523] [2024-11-10 14:38:35,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126702523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:35,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:35,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:35,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539502402] [2024-11-10 14:38:35,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:35,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:35,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:35,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:35,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:35,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-10 14:38:35,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 374 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:35,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:35,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-10 14:38:35,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:36,255 INFO L124 PetriNetUnfolderBase]: 1245/3768 cut-off events. [2024-11-10 14:38:36,256 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-10 14:38:36,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5487 conditions, 3768 events. 1245/3768 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27653 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5469. Up to 1563 conditions per place. [2024-11-10 14:38:36,278 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-11-10 14:38:36,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 373 transitions, 835 flow [2024-11-10 14:38:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-10 14:38:36,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-10 14:38:36,280 INFO L175 Difference]: Start difference. First operand has 373 places, 374 transitions, 775 flow. Second operand 3 states and 1271 transitions. [2024-11-10 14:38:36,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 373 transitions, 835 flow [2024-11-10 14:38:36,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 373 transitions, 825 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:38:36,284 INFO L231 Difference]: Finished difference. Result has 369 places, 373 transitions, 767 flow [2024-11-10 14:38:36,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=369, PETRI_TRANSITIONS=373} [2024-11-10 14:38:36,285 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -81 predicate places. [2024-11-10 14:38:36,285 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 373 transitions, 767 flow [2024-11-10 14:38:36,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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) [2024-11-10 14:38:36,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:36,286 INFO L204 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] [2024-11-10 14:38:36,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:38:36,286 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:36,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:36,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2022962763, now seen corresponding path program 1 times [2024-11-10 14:38:36,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:36,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205341681] [2024-11-10 14:38:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:36,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:36,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:36,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205341681] [2024-11-10 14:38:36,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205341681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:36,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:36,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:36,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439000777] [2024-11-10 14:38:36,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:36,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:36,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:36,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:36,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 527 [2024-11-10 14:38:36,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 373 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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) [2024-11-10 14:38:36,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:36,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 527 [2024-11-10 14:38:36,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:36,856 INFO L124 PetriNetUnfolderBase]: 1780/4956 cut-off events. [2024-11-10 14:38:36,856 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-11-10 14:38:36,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7433 conditions, 4956 events. 1780/4956 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 38790 event pairs, 383 based on Foata normal form. 0/4110 useless extension candidates. Maximal degree in co-relation 7307. Up to 1167 conditions per place. [2024-11-10 14:38:36,881 INFO L140 encePairwiseOnDemand]: 518/527 looper letters, 58 selfloop transitions, 3 changer transitions 0/389 dead transitions. [2024-11-10 14:38:36,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 389 transitions, 933 flow [2024-11-10 14:38:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-11-10 14:38:36,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8032890575585073 [2024-11-10 14:38:36,884 INFO L175 Difference]: Start difference. First operand has 369 places, 373 transitions, 767 flow. Second operand 3 states and 1270 transitions. [2024-11-10 14:38:36,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 389 transitions, 933 flow [2024-11-10 14:38:36,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 389 transitions, 929 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:36,890 INFO L231 Difference]: Finished difference. Result has 365 places, 369 transitions, 771 flow [2024-11-10 14:38:36,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=365, PETRI_TRANSITIONS=369} [2024-11-10 14:38:36,891 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -85 predicate places. [2024-11-10 14:38:36,891 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 369 transitions, 771 flow [2024-11-10 14:38:36,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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) [2024-11-10 14:38:36,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:36,892 INFO L204 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] [2024-11-10 14:38:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:38:36,893 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:36,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1553012456, now seen corresponding path program 1 times [2024-11-10 14:38:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560525489] [2024-11-10 14:38:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560525489] [2024-11-10 14:38:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560525489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:36,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:36,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117437681] [2024-11-10 14:38:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:36,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:36,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:36,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:36,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 527 [2024-11-10 14:38:36,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 369 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 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) [2024-11-10 14:38:36,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:36,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 527 [2024-11-10 14:38:36,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:37,773 INFO L124 PetriNetUnfolderBase]: 2303/6564 cut-off events. [2024-11-10 14:38:37,773 INFO L125 PetriNetUnfolderBase]: For 968/968 co-relation queries the response was YES. [2024-11-10 14:38:37,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10135 conditions, 6564 events. 2303/6564 cut-off events. For 968/968 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 56389 event pairs, 579 based on Foata normal form. 0/5496 useless extension candidates. Maximal degree in co-relation 10008. Up to 1571 conditions per place. [2024-11-10 14:38:37,812 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 50 selfloop transitions, 4 changer transitions 0/391 dead transitions. [2024-11-10 14:38:37,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 391 transitions, 946 flow [2024-11-10 14:38:37,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2024-11-10 14:38:37,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8216318785578748 [2024-11-10 14:38:37,815 INFO L175 Difference]: Start difference. First operand has 365 places, 369 transitions, 771 flow. Second operand 3 states and 1299 transitions. [2024-11-10 14:38:37,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 391 transitions, 946 flow [2024-11-10 14:38:37,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 391 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:37,822 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 795 flow [2024-11-10 14:38:37,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2024-11-10 14:38:37,823 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -84 predicate places. [2024-11-10 14:38:37,823 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 795 flow [2024-11-10 14:38:37,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 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) [2024-11-10 14:38:37,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:37,824 INFO L204 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] [2024-11-10 14:38:37,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:38:37,824 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:37,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:37,825 INFO L85 PathProgramCache]: Analyzing trace with hash -396967900, now seen corresponding path program 1 times [2024-11-10 14:38:37,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:37,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900001364] [2024-11-10 14:38:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:37,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:37,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900001364] [2024-11-10 14:38:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900001364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:37,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:37,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628388840] [2024-11-10 14:38:37,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:37,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:37,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 527 [2024-11-10 14:38:37,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 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) [2024-11-10 14:38:37,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:37,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 527 [2024-11-10 14:38:37,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:39,568 INFO L124 PetriNetUnfolderBase]: 3924/11032 cut-off events. [2024-11-10 14:38:39,569 INFO L125 PetriNetUnfolderBase]: For 2226/2226 co-relation queries the response was YES. [2024-11-10 14:38:39,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17702 conditions, 11032 events. 3924/11032 cut-off events. For 2226/2226 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 106461 event pairs, 1855 based on Foata normal form. 0/9200 useless extension candidates. Maximal degree in co-relation 17575. Up to 2935 conditions per place. [2024-11-10 14:38:39,618 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 60 selfloop transitions, 3 changer transitions 0/400 dead transitions. [2024-11-10 14:38:39,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 400 transitions, 1024 flow [2024-11-10 14:38:39,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1305 transitions. [2024-11-10 14:38:39,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.825426944971537 [2024-11-10 14:38:39,621 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 795 flow. Second operand 3 states and 1305 transitions. [2024-11-10 14:38:39,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 400 transitions, 1024 flow [2024-11-10 14:38:39,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 400 transitions, 1010 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:39,626 INFO L231 Difference]: Finished difference. Result has 367 places, 372 transitions, 805 flow [2024-11-10 14:38:39,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=367, PETRI_TRANSITIONS=372} [2024-11-10 14:38:39,627 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2024-11-10 14:38:39,627 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 372 transitions, 805 flow [2024-11-10 14:38:39,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 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) [2024-11-10 14:38:39,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:39,627 INFO L204 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] [2024-11-10 14:38:39,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:38:39,628 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:39,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1893193801, now seen corresponding path program 1 times [2024-11-10 14:38:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:39,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119330566] [2024-11-10 14:38:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:39,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119330566] [2024-11-10 14:38:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119330566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:39,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:39,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912003044] [2024-11-10 14:38:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:39,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:39,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:39,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:39,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:39,669 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 527 [2024-11-10 14:38:39,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 372 transitions, 805 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 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) [2024-11-10 14:38:39,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:39,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 527 [2024-11-10 14:38:39,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:41,840 INFO L124 PetriNetUnfolderBase]: 6937/19142 cut-off events. [2024-11-10 14:38:41,840 INFO L125 PetriNetUnfolderBase]: For 4021/4021 co-relation queries the response was YES. [2024-11-10 14:38:41,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31505 conditions, 19142 events. 6937/19142 cut-off events. For 4021/4021 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 204047 event pairs, 3342 based on Foata normal form. 0/16040 useless extension candidates. Maximal degree in co-relation 31376. Up to 5105 conditions per place. [2024-11-10 14:38:41,994 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 64 selfloop transitions, 4 changer transitions 0/403 dead transitions. [2024-11-10 14:38:41,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 403 transitions, 1054 flow [2024-11-10 14:38:41,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2024-11-10 14:38:41,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8241619228336496 [2024-11-10 14:38:41,996 INFO L175 Difference]: Start difference. First operand has 367 places, 372 transitions, 805 flow. Second operand 3 states and 1303 transitions. [2024-11-10 14:38:41,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 403 transitions, 1054 flow [2024-11-10 14:38:42,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 403 transitions, 1044 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:42,003 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 829 flow [2024-11-10 14:38:42,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=829, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2024-11-10 14:38:42,004 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -82 predicate places. [2024-11-10 14:38:42,005 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 829 flow [2024-11-10 14:38:42,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 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) [2024-11-10 14:38:42,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:42,005 INFO L204 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] [2024-11-10 14:38:42,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:38:42,006 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:42,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:42,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1380849805, now seen corresponding path program 1 times [2024-11-10 14:38:42,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:42,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747210101] [2024-11-10 14:38:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:42,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747210101] [2024-11-10 14:38:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747210101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:42,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11322318] [2024-11-10 14:38:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:42,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 527 [2024-11-10 14:38:42,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 829 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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) [2024-11-10 14:38:42,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:42,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 527 [2024-11-10 14:38:42,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:44,841 INFO L124 PetriNetUnfolderBase]: 9063/22322 cut-off events. [2024-11-10 14:38:44,841 INFO L125 PetriNetUnfolderBase]: For 5588/5588 co-relation queries the response was YES. [2024-11-10 14:38:44,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39223 conditions, 22322 events. 9063/22322 cut-off events. For 5588/5588 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 229502 event pairs, 1244 based on Foata normal form. 0/19160 useless extension candidates. Maximal degree in co-relation 39093. Up to 10869 conditions per place. [2024-11-10 14:38:45,045 INFO L140 encePairwiseOnDemand]: 521/527 looper letters, 64 selfloop transitions, 4 changer transitions 0/399 dead transitions. [2024-11-10 14:38:45,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 399 transitions, 1059 flow [2024-11-10 14:38:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2024-11-10 14:38:45,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8127767235926628 [2024-11-10 14:38:45,048 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 829 flow. Second operand 3 states and 1285 transitions. [2024-11-10 14:38:45,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 399 transitions, 1059 flow [2024-11-10 14:38:45,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 399 transitions, 1045 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:45,060 INFO L231 Difference]: Finished difference. Result has 367 places, 375 transitions, 841 flow [2024-11-10 14:38:45,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=841, PETRI_PLACES=367, PETRI_TRANSITIONS=375} [2024-11-10 14:38:45,061 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2024-11-10 14:38:45,061 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 375 transitions, 841 flow [2024-11-10 14:38:45,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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) [2024-11-10 14:38:45,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:45,062 INFO L204 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] [2024-11-10 14:38:45,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:38:45,062 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1692897774, now seen corresponding path program 1 times [2024-11-10 14:38:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721643741] [2024-11-10 14:38:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:45,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:45,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721643741] [2024-11-10 14:38:45,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721643741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:45,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:45,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:45,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949023567] [2024-11-10 14:38:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:45,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:45,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:45,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:45,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 527 [2024-11-10 14:38:45,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 375 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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) [2024-11-10 14:38:45,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:45,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 527 [2024-11-10 14:38:45,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:49,562 INFO L124 PetriNetUnfolderBase]: 11737/30512 cut-off events. [2024-11-10 14:38:49,563 INFO L125 PetriNetUnfolderBase]: For 7741/7741 co-relation queries the response was YES. [2024-11-10 14:38:49,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54535 conditions, 30512 events. 11737/30512 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 334722 event pairs, 2352 based on Foata normal form. 0/26197 useless extension candidates. Maximal degree in co-relation 54405. Up to 12037 conditions per place. [2024-11-10 14:38:50,201 INFO L140 encePairwiseOnDemand]: 521/527 looper letters, 69 selfloop transitions, 4 changer transitions 0/403 dead transitions. [2024-11-10 14:38:50,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 403 transitions, 1092 flow [2024-11-10 14:38:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-10 14:38:50,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8134092346616065 [2024-11-10 14:38:50,207 INFO L175 Difference]: Start difference. First operand has 367 places, 375 transitions, 841 flow. Second operand 3 states and 1286 transitions. [2024-11-10 14:38:50,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 403 transitions, 1092 flow [2024-11-10 14:38:50,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 403 transitions, 1092 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:38:50,215 INFO L231 Difference]: Finished difference. Result has 368 places, 376 transitions, 861 flow [2024-11-10 14:38:50,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=368, PETRI_TRANSITIONS=376} [2024-11-10 14:38:50,216 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -82 predicate places. [2024-11-10 14:38:50,216 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 376 transitions, 861 flow [2024-11-10 14:38:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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) [2024-11-10 14:38:50,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:50,217 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:50,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 14:38:50,217 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:50,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -208521977, now seen corresponding path program 1 times [2024-11-10 14:38:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507093122] [2024-11-10 14:38:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507093122] [2024-11-10 14:38:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507093122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:50,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362746956] [2024-11-10 14:38:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:50,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:50,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:50,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:50,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 527 [2024-11-10 14:38:50,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 376 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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) [2024-11-10 14:38:50,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:50,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 527 [2024-11-10 14:38:50,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:54,643 INFO L124 PetriNetUnfolderBase]: 10771/30709 cut-off events. [2024-11-10 14:38:54,643 INFO L125 PetriNetUnfolderBase]: For 9560/9560 co-relation queries the response was YES. [2024-11-10 14:38:54,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55746 conditions, 30709 events. 10771/30709 cut-off events. For 9560/9560 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 355195 event pairs, 4412 based on Foata normal form. 0/26184 useless extension candidates. Maximal degree in co-relation 55615. Up to 13869 conditions per place. [2024-11-10 14:38:55,098 INFO L140 encePairwiseOnDemand]: 525/527 looper letters, 42 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2024-11-10 14:38:55,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 375 transitions, 945 flow [2024-11-10 14:38:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1278 transitions. [2024-11-10 14:38:55,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8083491461100569 [2024-11-10 14:38:55,101 INFO L175 Difference]: Start difference. First operand has 368 places, 376 transitions, 861 flow. Second operand 3 states and 1278 transitions. [2024-11-10 14:38:55,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 375 transitions, 945 flow [2024-11-10 14:38:55,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 945 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:38:55,112 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 861 flow [2024-11-10 14:38:55,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=369, PETRI_TRANSITIONS=375} [2024-11-10 14:38:55,113 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -81 predicate places. [2024-11-10 14:38:55,113 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 861 flow [2024-11-10 14:38:55,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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) [2024-11-10 14:38:55,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:55,113 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:55,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 14:38:55,114 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-10 14:38:55,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1798532750, now seen corresponding path program 1 times [2024-11-10 14:38:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:55,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363169254] [2024-11-10 14:38:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:55,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363169254] [2024-11-10 14:38:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363169254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:55,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:55,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162363022] [2024-11-10 14:38:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:55,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:55,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:55,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:55,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 527 [2024-11-10 14:38:55,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 375 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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) [2024-11-10 14:38:55,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:55,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 527 [2024-11-10 14:38:55,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:59,284 INFO L124 PetriNetUnfolderBase]: 10771/30708 cut-off events. [2024-11-10 14:38:59,284 INFO L125 PetriNetUnfolderBase]: For 9560/9560 co-relation queries the response was YES. [2024-11-10 14:38:59,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55746 conditions, 30708 events. 10771/30708 cut-off events. For 9560/9560 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 355414 event pairs, 4412 based on Foata normal form. 1/26184 useless extension candidates. Maximal degree in co-relation 55732. Up to 13869 conditions per place. [2024-11-10 14:38:59,523 INFO L140 encePairwiseOnDemand]: 525/527 looper letters, 0 selfloop transitions, 0 changer transitions 374/374 dead transitions. [2024-11-10 14:38:59,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 943 flow [2024-11-10 14:38:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2024-11-10 14:38:59,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8077166350411132 [2024-11-10 14:38:59,525 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 861 flow. Second operand 3 states and 1277 transitions. [2024-11-10 14:38:59,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 943 flow [2024-11-10 14:38:59,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 374 transitions, 942 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:38:59,536 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2024-11-10 14:38:59,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2024-11-10 14:38:59,537 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -81 predicate places. [2024-11-10 14:38:59,537 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2024-11-10 14:38:59,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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) [2024-11-10 14:38:59,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (146 of 147 remaining) [2024-11-10 14:38:59,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (145 of 147 remaining) [2024-11-10 14:38:59,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (144 of 147 remaining) [2024-11-10 14:38:59,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (143 of 147 remaining) [2024-11-10 14:38:59,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (142 of 147 remaining) [2024-11-10 14:38:59,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (141 of 147 remaining) [2024-11-10 14:38:59,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (140 of 147 remaining) [2024-11-10 14:38:59,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (139 of 147 remaining) [2024-11-10 14:38:59,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (138 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (137 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (136 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (135 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (134 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (133 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (132 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (131 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (130 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (129 of 147 remaining) [2024-11-10 14:38:59,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (127 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (126 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (125 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (124 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (123 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (122 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (121 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (120 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (119 of 147 remaining) [2024-11-10 14:38:59,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (118 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (117 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (116 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (115 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (114 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (113 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (112 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (111 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (110 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (109 of 147 remaining) [2024-11-10 14:38:59,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (108 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (107 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (106 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (105 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (104 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (103 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (102 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (101 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (100 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (99 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (98 of 147 remaining) [2024-11-10 14:38:59,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (97 of 147 remaining) [2024-11-10 14:38:59,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (96 of 147 remaining) [2024-11-10 14:38:59,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (95 of 147 remaining) [2024-11-10 14:38:59,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (94 of 147 remaining) [2024-11-10 14:38:59,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (93 of 147 remaining) [2024-11-10 14:38:59,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (92 of 147 remaining) [2024-11-10 14:38:59,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (91 of 147 remaining) [2024-11-10 14:38:59,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (90 of 147 remaining) [2024-11-10 14:38:59,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (89 of 147 remaining) [2024-11-10 14:38:59,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (86 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (85 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (84 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (83 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (82 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (79 of 147 remaining) [2024-11-10 14:38:59,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (78 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (77 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (76 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (75 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (74 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (73 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (72 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (71 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (70 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (69 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (68 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (67 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (66 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (65 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (64 of 147 remaining) [2024-11-10 14:38:59,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (63 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (62 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (61 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (60 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (59 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (58 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (57 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (49 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 147 remaining) [2024-11-10 14:38:59,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (44 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (39 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (38 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (37 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (36 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (35 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (33 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (31 of 147 remaining) [2024-11-10 14:38:59,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (30 of 147 remaining) [2024-11-10 14:38:59,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (29 of 147 remaining) [2024-11-10 14:38:59,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (28 of 147 remaining) [2024-11-10 14:38:59,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (27 of 147 remaining) [2024-11-10 14:38:59,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (26 of 147 remaining) [2024-11-10 14:38:59,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (25 of 147 remaining) [2024-11-10 14:38:59,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (24 of 147 remaining) [2024-11-10 14:38:59,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 147 remaining) [2024-11-10 14:38:59,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 147 remaining) [2024-11-10 14:38:59,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (21 of 147 remaining) [2024-11-10 14:38:59,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (20 of 147 remaining) [2024-11-10 14:38:59,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (19 of 147 remaining) [2024-11-10 14:38:59,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (18 of 147 remaining) [2024-11-10 14:38:59,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (17 of 147 remaining) [2024-11-10 14:38:59,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (16 of 147 remaining) [2024-11-10 14:38:59,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (15 of 147 remaining) [2024-11-10 14:38:59,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (14 of 147 remaining) [2024-11-10 14:38:59,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (13 of 147 remaining) [2024-11-10 14:38:59,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (12 of 147 remaining) [2024-11-10 14:38:59,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (11 of 147 remaining) [2024-11-10 14:38:59,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (10 of 147 remaining) [2024-11-10 14:38:59,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (9 of 147 remaining) [2024-11-10 14:38:59,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (8 of 147 remaining) [2024-11-10 14:38:59,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (7 of 147 remaining) [2024-11-10 14:38:59,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (6 of 147 remaining) [2024-11-10 14:38:59,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (5 of 147 remaining) [2024-11-10 14:38:59,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (4 of 147 remaining) [2024-11-10 14:38:59,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 147 remaining) [2024-11-10 14:38:59,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 147 remaining) [2024-11-10 14:38:59,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 147 remaining) [2024-11-10 14:38:59,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 147 remaining) [2024-11-10 14:38:59,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 14:38:59,687 INFO L407 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, 1] [2024-11-10 14:38:59,693 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:38:59,694 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:38:59,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:38:59 BasicIcfg [2024-11-10 14:38:59,701 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:38:59,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:38:59,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:38:59,702 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:38:59,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:38:26" (3/4) ... [2024-11-10 14:38:59,704 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:38:59,706 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:38:59,706 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:38:59,706 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:38:59,706 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-10 14:38:59,706 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-10 14:38:59,707 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-10 14:38:59,717 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-10 14:38:59,722 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:38:59,723 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:38:59,723 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:38:59,819 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:38:59,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:38:59,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:38:59,820 INFO L158 Benchmark]: Toolchain (without parser) took 34957.59ms. Allocated memory was 178.3MB in the beginning and 8.8GB in the end (delta: 8.7GB). Free memory was 115.9MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-10 14:38:59,821 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:38:59,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.59ms. Allocated memory is still 178.3MB. Free memory was 115.9MB in the beginning and 142.9MB in the end (delta: -27.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:38:59,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.06ms. Allocated memory is still 178.3MB. Free memory was 142.9MB in the beginning and 138.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:38:59,821 INFO L158 Benchmark]: Boogie Preprocessor took 43.49ms. Allocated memory is still 178.3MB. Free memory was 138.8MB in the beginning and 135.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:38:59,822 INFO L158 Benchmark]: IcfgBuilder took 1236.60ms. Allocated memory was 178.3MB in the beginning and 224.4MB in the end (delta: 46.1MB). Free memory was 135.7MB in the beginning and 123.1MB in the end (delta: 12.5MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2024-11-10 14:38:59,822 INFO L158 Benchmark]: TraceAbstraction took 33197.04ms. Allocated memory was 224.4MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 122.1MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-10 14:38:59,822 INFO L158 Benchmark]: Witness Printer took 118.66ms. Allocated memory is still 8.8GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 14:38:59,824 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.59ms. Allocated memory is still 178.3MB. Free memory was 115.9MB in the beginning and 142.9MB in the end (delta: -27.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.06ms. Allocated memory is still 178.3MB. Free memory was 142.9MB in the beginning and 138.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.49ms. Allocated memory is still 178.3MB. Free memory was 138.8MB in the beginning and 135.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1236.60ms. Allocated memory was 178.3MB in the beginning and 224.4MB in the end (delta: 46.1MB). Free memory was 135.7MB in the beginning and 123.1MB in the end (delta: 12.5MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. * TraceAbstraction took 33197.04ms. Allocated memory was 224.4MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 122.1MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 118.66ms. Allocated memory is still 8.8GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: 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: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: 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: 131]: 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: 133]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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 13 procedures, 626 locations, 147 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: 33.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1645 IncrementalHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 69 mSDtfsCounter, 1645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=0, InterpolantAutomatonStates: 72, 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.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2954 NumberOfCodeBlocks, 2954 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2931 ConstructedInterpolants, 0 QuantifiedInterpolants, 3090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 - AllSpecificationsHoldResult: All specifications hold 83 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:38:59,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE